using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;


class RMQ
{
    internal int n;
    internal long[] dat;

    public RMQ(int t)
    {
        n = t;
        dat = new long[2 * n - 1];
        for (int i = 0; i < 2 * n - 1; i++)
        {
            dat[i] = long.MaxValue;
        }
    }

    public void update(int k, long a)
    {
        k += n - 1;
        dat[k] = a;
        while (k > 0)
        {
            k = (k - 1) / 2;
            dat[k] = Math.Min(dat[k * 2 + 1], dat[k * 2 + 2]);
        }
    }

    public long query(int a, int b, int k, int l, int r)
    {
        if (r <= a || b <= l) return long.MaxValue;

        if (a <= l && r <= b) return dat[k];
        else
        {
            var vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
            var vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
            return Math.Min(vl, vr);
        }
    }
}
class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }

    void solve()
    {
        int N = cin.nextint;
        int M = cin.nextint;
        int S = cin.nextint - 1;
        int T = cin.nextint - 1;
        input(N, M);
        dijkstra(S, T);
        int n = 1;
        while (n < N) n *= 2;
        var ST = new RMQ(n);
        for (int i = 0; i < N; i++)
        {
            var COST = D[i] + E2[i];
            //WriteLine(D[i] + " " + E2[i]);
            ST.update(i, COST);
        }
        for (int i = 0; i < N; i++)
        {
            long MONEY = 1000000000000000L;
            var COST = ST.query(i, N, 0, 0, n);
            WriteLine(MONEY - COST);
        }

    }
    // ref: http://abc070.contest.atcoder.jp/submissions/1505233
    struct Edge : IComparable<Edge>
    {
        public int to; public long cost;
        public Edge(int to, long cost)
        {
            this.to = to;
            this.cost = cost;
        }
        public int CompareTo(Edge e)
        {
            return cost.CompareTo(e.cost);
        }
    }
    List<Edge>[] G;
    long[] D, D2;
    List<Edge>[] H;
    long[] E, E2;
    const long inf = long.MaxValue / 3;
    void input(int n, int m)
    {
        G = Enumerable.Range(0, n).Select(i => new List<Edge>()).ToArray();
        H = Enumerable.Range(0, n).Select(i => new List<Edge>()).ToArray();
        for (int i = 0; i < m; i++)
        {
            int a = cin.nextint - 1;
            int b = cin.nextint - 1;
            long c = cin.nextlong;
            long d = cin.nextlong;
            G[a].Add(new Edge(b, c));
            G[b].Add(new Edge(a, c));
            H[a].Add(new Edge(b, d));
            H[b].Add(new Edge(a, d));
        }



    }
    void dijkstra(int s, int t)
    {
        int n = G.Length;
        D = Enumerable.Repeat(inf, n).ToArray();
        var Q = new PriorityQueue<Edge>();//小さい順に取り出すので要素に-1を掛ける
        D[s] = 0;
        Q.Enqueue(new Edge(s, D[s]));
        while (Q.Any())
        {
            var e = Q.Dequeue();
            var v = e.to;
            if (D[v] < -e.cost) continue;
            foreach (var gv in G[v])
            {
                if (D[gv.to] > D[v] + gv.cost)
                {
                    D[gv.to] = D[v] + gv.cost;
                    Q.Enqueue(new Edge(gv.to, -D[gv.to]));
                }
            }
        }
        D2 = Enumerable.Repeat(inf, n).ToArray();
        Q = new PriorityQueue<Edge>();//小さい順に取り出すので要素に-1を掛ける
        D2[t] = 0;
        Q.Enqueue(new Edge(t, D2[t]));
        while (Q.Any())
        {
            var e = Q.Dequeue();
            var v = e.to;
            if (D2[v] < -e.cost) continue;
            foreach (var gv in G[v])
            {
                if (D2[gv.to] > D2[v] + gv.cost)
                {
                    D2[gv.to] = D2[v] + gv.cost;
                    Q.Enqueue(new Edge(gv.to, -D2[gv.to]));
                }
            }
        }

        E = Enumerable.Repeat(inf, n).ToArray();
        Q = new PriorityQueue<Edge>();//小さい順に取り出すので要素に-1を掛ける
        E[s] = 0;
        Q.Enqueue(new Edge(s, E[s]));
        while (Q.Any())
        {
            var e = Q.Dequeue();
            var v = e.to;
            if (E[v] < -e.cost) continue;
            foreach (var gv in H[v])
            {
                if (E[gv.to] > E[v] + gv.cost)
                {
                    E[gv.to] = E[v] + gv.cost;
                    Q.Enqueue(new Edge(gv.to, -E[gv.to]));
                }
            }
        }

        E2 = Enumerable.Repeat(inf, n).ToArray();
        Q = new PriorityQueue<Edge>();//小さい順に取り出すので要素に-1を掛ける
        E2[t] = 0;
        Q.Enqueue(new Edge(t, E2[t]));
        while (Q.Any())
        {
            var e = Q.Dequeue();
            var v = e.to;
            if (E2[v] < -e.cost) continue;
            foreach (var gv in H[v])
            {
                if (E2[gv.to] > E2[v] + gv.cost)
                {
                    E2[gv.to] = E2[v] + gv.cost;
                    Q.Enqueue(new Edge(gv.to, -E2[gv.to]));
                }
            }
        }

    }
    class PriorityQueue<T> where T : IComparable<T>
    {
        List<T> heap;
        int size;
        int Compare(T x, T y) { return y.CompareTo(x); }
        public PriorityQueue() { heap = new List<T>(); }
        public void Enqueue(T x)
        {
            heap.Add(x);
            int i = size++;

            while (i > 0)
            {
                int p = (i - 1) >> 1;

                if (Compare(heap[p], x) <= 0) break;

                heap[i] = heap[p];
                i = p;
            }
            heap[i] = x;
        }
        public T Dequeue()
        {
            T ret = heap[0];
            T x = heap[--size];

            int i = 0;
            while ((i << 1) + 1 < size)
            {
                int a = (i << 1) + 1;
                int b = (i << 1) + 2;

                if (b < size && Compare(heap[b], heap[a]) < 0)
                    a = b;
                if (Compare(heap[a], x) >= 0)
                    break;

                heap[i] = heap[a];
                i = a;
            }
            heap[i] = x;
            heap.RemoveAt(size);
            return ret;
        }
        public int Count { get { return size; } }

        public bool Any() { return size > 0; }

        public T Peek() { return heap[0]; }
    }
}

class Scanner
{
    string[] s; int i;
    char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
}

Measured memory_bytes: 65628