using System;
using System.Collections.Generic;
using System.Linq;
using Edge = Pair<long, int>;
using static System.Console;
using static System.Convert;
using static System.Math;
//using Debug;
//using static System.Globalization.CultureInfo;
using System.Text;
class Program
{ 
    static void Main(string[] args)
    {
        Solve();
        //WriteLine(Solve());
    }
    static int[] nmst;
    static void Solve()
    {
        nmst = Input.ar;
        var r = (long)1e15;
        var yeg = Enumerable.Repeat(0, nmst[0]).Select(_ => new List<Edge>()).ToArray();
        var keg = Enumerable.Repeat(0, nmst[0]).Select(_ => new List<Edge>()).ToArray();
        for(var i = 0; i < nmst[1]; i++)
        {
            var inp = Input.ar;
            inp[0]--;inp[1]--;
            for(var j = 0; j < 2; j++)
            {
                yeg[inp[j]].Add(new Edge(inp[2], inp[1 - j]));
                keg[inp[j]].Add(new Edge(inp[3], inp[1 - j]));
            }
        }
        var ydist = di(yeg, --nmst[2]);
        var kdist = di(keg, --nmst[3]);
        var res = new List<long> { r - ydist[nmst[0] - 1] - kdist[nmst[0] - 1] };
        for (var i = nmst[0] - 2; i >= 0; i--)
            res.Add(Max(res.Last(), r - ydist[i] - kdist[i]));
        res.Reverse();
        WriteLine(string.Join("\n", res));
    }
    static long[] di(List<Edge>[] edge,int s)
    {
        var dist = Enumerable.Repeat(long.MaxValue / 2, nmst[0]).ToArray();
        dist[s] = 0;
        var pq = new PriorityQueue<Edge>(false);
        pq.Enqueue(new Edge(0, s));
        while (pq.Count != 0)
        {
            var p = pq.Dequeue();
            foreach (var e in edge[p.v2])
                if (dist[e.v2] > p.v1 + e.v1)
                {
                    dist[e.v2] = p.v1 + e.v1;
                    pq.Enqueue(new Edge(dist[e.v2], e.v2));
                }
        }
        return dist;
    }
}

public class Input
{
    public static string read => ReadLine().Trim();
    public static int[] ar => read.Split(' ').Select(int.Parse).ToArray();
    public  static int num => ToInt32(read);
    public static long[] arL => read.Split(' ').Select(long.Parse).ToArray();
    public  static long numL => ToInt64(read);
    public static char[][] gred(int h) 
        => Enumerable.Repeat(0, h).Select(_ => read.ToCharArray()).ToArray();
    public static int[][] ar2D(int num)
        => Enumerable.Repeat(0, num).Select(_ => ar).ToArray();
    public static long[][] arL2D(int num)
        => Enumerable.Repeat(0, num).Select(_ => arL).ToArray();
    public static T getValue<T>(string g)
    {
        var t = typeof(T);
        if (t == typeof(int))
            return (T)(object)int.Parse(g);
        if (t == typeof(long))
            return (T)(object)long.Parse(g);
        if (t == typeof(string))
            return (T)(object)g;
        if (t == typeof(char))
            return (T)(object)char.Parse(g);
        if (t == typeof(double))
            return (T)(object)double.Parse(g);
        if (t == typeof(bool))
            return (T)(object)bool.Parse(g);
        return default(T);
    }
    public const long Inf = (long)1e18;
    public const double eps = 1e-6;
    public  const string Alfa = "abcdefghijklmnopqrstuvwxyz";
    public  const int MOD = 1000000007;
}
public class PriorityQueue<T> where T : IComparable<T>
{
    private List<T> _item;
    public int Count { get { return _item.Count; } }
    public bool IsMaxHeap { get; set; }
    public T Peek { get { return _item[0]; } }
    public PriorityQueue(bool IsMaxHeap = true) { _item = new List<T>(); this.IsMaxHeap = IsMaxHeap; }
    private int Compare(int i, int j) => (IsMaxHeap ? 1 : -1) * _item[i].CompareTo(_item[j]);
    private int Parent(int i)
        => (i - 1) >> 1;
    private int Left(int i)
        => (i << 1) + 1;
    public void Enqueue(T val)
    {
        int i = _item.Count;
        _item.Add(val);
        while (i > 0)
        {
            int p = Parent(i);
            if (Compare(i, p) > 0)
            {
                var tmp = _item[i];
                _item[i] = _item[p];
                _item[p] = tmp;
            }
            i = p;
        }
    }
    public T Dequeue()
    {
        T val = _item[0];
        _item[0] = _item[_item.Count-1];
        _item.RemoveAt(_item.Count - 1);
        for (int i = 0, j; (j = Left(i)) < _item.Count; i = j)
        {
            if (j != _item.Count - 1 && Compare(j, j + 1) < 0) j++;
            if (Compare(i, j) < 0)
            {
                var tmp = _item[i];
                _item[i] = _item[j];
                _item[j] = tmp;
            }
        }
        return val;
    }
}

public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1 { get; set; }
    public T2 v2 { get; set; }
    public Pair() : this(default(T1), default(T2)) { }
    public Pair(T1 v1, T2 v2)
    { SetValue(v1, v2); }

    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public void SetValue(T1 v1,T2 v2) { this.v1 = v1;this.v2 = v2; }
    public static Pair<T1, T2> MakePair()
    {
        var r = ReadLine().Split(' ');
        return new Pair<T1, T2>(Input.getValue<T1>(r[0]), Input.getValue<T2>(r[1]));
    }
    public override string ToString()
        => $"{v1.ToString()} {v2.ToString()}";
}


Measured memory_bytes: 69636