using System;
using System.Collections.Generic;
class Program
{
	static void Main(string[] args)
	{
		string[] str = Console.ReadLine().Split();
		long n = long.Parse(str[0]);
		long m = long.Parse(str[1]);
		long s = long.Parse(str[2]);
		long t = long.Parse(str[3]);
		List<long>[] ma = new List<long>[n];
		for(var i=0;i<n;i++){
			ma[i] = new List<long>();
		}
		long[,]a = new long[m,4];
		for(var i=0;i<m;i++){
			string[] str2 = Console.ReadLine().Split();
			a[i,0] = long.Parse(str2[0]);
			a[i,1] = long.Parse(str2[1]);
			a[i,2] = long.Parse(str2[2]);
			a[i,3] = long.Parse(str2[3]);
			ma[a[i,0]-1].Add(i);
			ma[a[i,1]-1].Add(i);
		}
		long[] nd = new long[n];
		long[] ndf = new long[n];
		for(var i=0;i<n;i++){
			nd[i] = 9999999999999999;
		}
		nd[s-1] = 0;
		long dmin = -1;
		long dmins = -1;
		var qlist = new PriorityQueue<long>((l, r) => nd[l].CompareTo(nd[r]));
		qlist.Enqueue(s-1);
		while(true){
			while(true){
				if(qlist.Count == 0){
					dmins = -1;
					break;
				}
				dmins = qlist.Dequeue();
				if(ndf[dmins] == 0){
					dmin = nd[dmins];
					break;
				}
			}
			if(dmins == -1){
				break;
			}
			ndf[dmins] = 1;
			for(var i=0;i<ma[dmins].Count;i++){
				if(a[ma[dmins][i],0]-1 == dmins){
					if(dmin+a[ma[dmins][i],2] < nd[a[ma[dmins][i],1]-1]){
						nd[a[ma[dmins][i],1]-1] = Math.Min(nd[a[ma[dmins][i],1]-1],dmin+a[ma[dmins][i],2]);
						qlist.Enqueue(a[ma[dmins][i],1]-1);
					}
				}
				if(a[ma[dmins][i],1]-1 == dmins){
					if(dmin+a[ma[dmins][i],2] < nd[a[ma[dmins][i],0]-1]){
						nd[a[ma[dmins][i],0]-1] = Math.Min(nd[a[ma[dmins][i],0]-1],dmin+a[ma[dmins][i],2]);
						qlist.Enqueue(a[ma[dmins][i],0]-1);
					}
				}
			}
		}
		long[] nd2 = new long[n];
		long[] ndf2 = new long[n];
		for(var i=0;i<n;i++){
			nd2[i] = 9999999999999999;
		}
		nd2[t-1] = 0;
		var qlist2 = new PriorityQueue<long>((l, r) => nd2[l].CompareTo(nd2[r]));
		qlist2.Enqueue(t-1);
		while(true){
			while(true){
				if(qlist2.Count == 0){
					dmins = -1;
					break;
				}
				dmins = qlist2.Dequeue();
				if(ndf2[dmins] == 0){
					dmin = nd2[dmins];
					break;
				}
			}
			if(dmins == -1){
				break;
			}
			ndf2[dmins] = 1;
			for(var i=0;i<ma[dmins].Count;i++){
				if(a[ma[dmins][i],0]-1 == dmins){
					if(dmin+a[ma[dmins][i],3] < nd2[a[ma[dmins][i],1]-1]){
						nd2[a[ma[dmins][i],1]-1] = Math.Min(nd2[a[ma[dmins][i],1]-1],dmin+a[ma[dmins][i],3]);
						qlist2.Enqueue(a[ma[dmins][i],1]-1);
					}
				}
				if(a[ma[dmins][i],1]-1 == dmins){
					if(dmin+a[ma[dmins][i],3] < nd2[a[ma[dmins][i],0]-1]){
						nd2[a[ma[dmins][i],0]-1] = Math.Min(nd2[a[ma[dmins][i],0]-1],dmin+a[ma[dmins][i],3]);
						qlist2.Enqueue(a[ma[dmins][i],0]-1);
					}
				}
			}
		}
		long[]ys = new long[n];
		ys[n-1] = nd[n-1]+nd2[n-1];
		for(var i=n-2;i>=0;i--){
			ys[i] = Math.Min(ys[i+1],nd[i]+nd2[i]);
		}		
		for(var i=0;i<n;i++){
			Console.WriteLine(Math.Pow(10,15)-ys[i]);
		}
	}
}

class PriorityQueue<T>
{
    private readonly List<T> heap;
    private readonly Comparison<T> compare;
    private int size;
    public PriorityQueue() : this(Comparer<T>.Default) {} 
    public PriorityQueue(IComparer<T> comparer) : this(16, comparer.Compare) { }
    public PriorityQueue(Comparison<T> comparison) : this(16, comparison) { }
    public PriorityQueue(int capacity, Comparison<T> comparison)
    {
        this.heap = new List<T>(capacity);
        this.compare = comparison;
    }
    public void Enqueue(T item)
    {
        this.heap.Add(item);
        var i = size++;
        while (i > 0)
        {
            var p = (i - 1) >> 1;
            if (compare(this.heap[p], item) <= 0)
                break;
            this.heap[i] = heap[p];
            i = p;
        }
        this.heap[i] = item;

    }
    public T Dequeue()
    {
        var ret = this.heap[0];
        var x = this.heap[--size];
        var i = 0;
        while ((i << 1) + 1 < size)
        {
            var a = (i << 1) + 1;
            var 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 T Peek() { return heap[0]; }
    public int Count { get { return size; } }
    public bool Any() { return size > 0; }
}

Measured memory_bytes: 40208