using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Convert;
using static System.Math;
//using static System.Globalization.CultureInfo;

class Program
{
    class P:IComparable<P>
    {
        public int index;
        public List<int> ad;
        public Dictionary<int, int>[] curr;
        public long Weight;
        public P(int index,long Weight)
        {
            this.index = index;
            ad = new List<int>();
            this.Weight = Weight;
            curr = Enumerable.Repeat(0, 2).Select(v => new Dictionary<int, int>()).ToArray();
        }
        public int CompareTo(P p)
            => Weight.CompareTo(p.Weight);
    }
    static void Main(string[] args)
    {
        var nmst = Input.ar;
        var res = new long[nmst[0]];
        var priQueue = new PriorityQueue<P>(false,new P(-1,long.MaxValue));
        var ps = Enumerable.Range(0, nmst[0]).Select(v => new P(v, long.MaxValue)).ToArray();
        var curr = new[] {
        Enumerable.Repeat(long.MaxValue, nmst[0]).ToArray(),
        Enumerable.Repeat(long.MaxValue, nmst[0]).ToArray(),
        };
        for(var i = 0; i < nmst[1]; i++)
        {
            var inp = Input.ar;
            for(var j = 0; j < 2; j++)
            {
                ps[inp[j] - 1].ad.Add(inp[(j + 1) % 2] - 1);
                ps[inp[j] - 1].curr[0][inp[(j + 1) % 2] - 1] = inp[2];
                ps[inp[j] - 1].curr[1][inp[(j + 1) % 2] - 1] = inp[3];
            }
        }
        for(var i = 0; i < 2; i++)
        {
            if (i == 1)
                for (var j = 0; j < nmst[0]; j++)
                    ps[j].Weight = long.MaxValue;
            curr[i][nmst[i + 2] - 1] = 0;
            ps[nmst[i + 2] - 1].Weight = 0;
            priQueue.Enqueue(ps[nmst[i + 2] - 1]);
            var isTh = new bool[nmst[0]];
            while (!priQueue.isEmpty)
            {
                var u = priQueue.Dequeue();
                isTh[u.index] = true;
                foreach (var ad in u.ad)
                    if (!isTh[ad] && ps[ad].Weight > u.Weight + u.curr[i][ad])
                    {
                        var wei = u.Weight + u.curr[i][ad];
                        ps[ad].Weight = wei;
                        curr[i][ad] = wei;
                        priQueue.Enqueue(ps[ad]);
                    }
            }
        }
        res[nmst[0] - 1] = (long)1e15 - (curr[0][nmst[0] - 1] + curr[1][nmst[0] - 1]);
        for(var i = nmst[0] - 2; i >= 0; i--)
        {
            var snu = (long)1e15;
            var calc = snu - (curr[0][i] + curr[1][i]);
            res[i] = Max(res[i + 1], calc);
        }
        WriteLine(string.Join("\n", res));
    }
}

public class Input
{
    public static string read => ReadLine();
    public  static int[] ar => Array.ConvertAll(read.Split(' '), int.Parse);
    public  static int num => ToInt32(read);
    public  static long[] arL => Array.ConvertAll(read.Split(' '), long.Parse);
    public  static long numL => ToInt64(read);
    public  const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public  const int MOD = 1000000007;
}

public class PriorityQueue<T> where T : IComparable<T>
{
    private readonly List<T> items;
    private T MinValue { get; }//一番優先度が低い値

    public bool IsMax { get; }
    public int Size { get { return items.Count; } }
    public bool isEmpty { get { return items.Count == 0; } }
    
    public PriorityQueue(T minValue) : this(true, minValue)
    {

    }

    public PriorityQueue(bool IsMax, T MinValue)
    {
        this.items = new List<T>();
        this.IsMax = IsMax;
        this.MinValue = MinValue;
    }

    private int Parent(int num)
    {
        return (int)Math.Ceiling((double)num / 2) - 1;
    }
    private int Left(int num)
    { 
        return 2 * num + 1;
    }
    private int Right(int num)
    { 
        return 2 * (num + 1);
    }

    private void MaxHeapify(int num)
    {
        var left = Left(num);
        var right = Right(num);
        var largest = 0;
        if (Size >= left + 1 && items[left].CompareTo(items[num]) == 1)
            largest = left;
        else largest = num;
        if (Size >= right + 1 && items[right].CompareTo(items[largest]) == 1)
            largest = right;
        if (largest != num)
        {
            var value = items[largest];
            items[largest] = items[num];
            items[num] = value;
            MaxHeapify(largest);
        }
    }

    private void MinHeapify(int num)
    {
        var left = Left(num);
        var right = Right(num);
        var smallest = 0;
        if (Size >= left + 1 && items[num].CompareTo(items[left]) == 1) smallest = left;
        else smallest = num;
        if (Size >= right + 1 && items[smallest].CompareTo(items[right]) == 1) smallest = right;
        if (smallest != num)
        {
            var value = items[smallest];
            items[smallest] = items[num];
            items[num] = value;
            MinHeapify(smallest);
        }
    }

    private void BuildHeap()
    {
        for (var i = (int)Math.Ceiling((double)Size / 2) - 1; i >= 0; i--)
        {
            if (IsMax) MaxHeapify(i);
            else MinHeapify(i);
        }
    }

    private bool ChangeKey(int index, T reValue)
    {
        if (IsMax && items[index].CompareTo(reValue) == 1)
            return false;
        if (!IsMax && items[index].CompareTo(reValue) == -1)
            return false;
        items[index] = reValue;
        if (IsMax)
        {
            while (index > 0 && items[Parent(index)].CompareTo(items[index]) == -1)
            {
                var value = items[Parent(index)];
                items[Parent(index)] = items[index];
                items[index] = value;
                index = Parent(index);
            }
        }
        else
        {
            while (index > 0 && items[Parent(index)].CompareTo(items[index]) == 1)
            {
                var value = items[Parent(index)];
                items[Parent(index)] = items[index];
                items[index] = value;
                index = Parent(index);
            }
        }
        return true;
    }

    public T Peek { get { return items[0]; } }

    public T Dequeue()
    {
        if (Size <= 0) return default(T);
        var value = items[0];
        items[0] = items[Size - 1];
        items.RemoveAt(Size - 1);
        if (IsMax) MaxHeapify(0);
        else MinHeapify(0);
        return value;
    }

    public bool Enqueue(T key)
    {
        items.Add(MinValue);
        return ChangeKey(Size - 1, key);
    }

    public bool Delete(int index)
    {
        if (index >= Size)
            return false;
        var value = items[index];
        items[index] = items[Size - 1];
        items[Size - 1] = value;
        items.RemoveAt(Size - 1);
        if (IsMax) MaxHeapify(0);
        else MinHeapify(0);
        return true;
    }
}


Measured memory_bytes: 97248