#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <math.h>
#include <limits.h>

typedef struct{
    long long q;
    long long i;
}queue_t;

int main(void){
    long long n,p,s,t,count;
    scanf("%lld%lld%lld%lld",&n,&p,&s,&t);
    bool visited[n+1];
    

    long long mm=0,head[3*p+1],next[3*p+1],to[3*p+1],leny[3*p+1],lens[3*p+1];
    for (int i=0; i<=n; i++){
        head[i]=-1;
    }
    for (long long i=0; i<p; i++){
        long long u,v,a,b;
        scanf("%lld%lld%lld%lld",&u,&v,&a,&b);
        next[mm]=head[u];
        head[u]=mm;
        to[mm]=v;
        leny[mm]=a;
        lens[mm]=b;
        mm++;
        next[mm]=head[v];
        head[v]=mm;
        to[mm]=u;
        leny[mm]=a;
        lens[mm]=b;        
        mm++;
    }
    
    long long countans=0;
    count=0;
    queue_t q[n*50],tmpq;
    long long d[n+1];
    for (long long i=0; i<=n; i++){
        visited[i]=false;
        d[i]=1e17;
        q[i].q=d[i];
        q[i].i=i;
        count++;
    }
    d[s]=0;
    q[0].q=-1e17;
    q[count].q=d[s];
    q[count].i=s;
    for (long long i=count; i>0; i=i/2){
        if (i/2!=0 && q[i].q<=q[i/2].q){
            tmpq=q[i];
            q[i]=q[i/2];
            q[i/2]=tmpq;
        } else {
            break;
        }
    }
    for (long long i=0; i<=n; i++){
        long long now=q[1].i;
        q[1]=q[count];
        long long bf=1;
        while(1){
            if (bf*2>count){
                break;
            }
            if (q[bf*2].q<=q[bf*2+1].q){
                if (q[bf].q>q[bf*2].q){
                    tmpq=q[bf];
                    q[bf]=q[bf*2];
                    q[bf*2]=tmpq;
                    bf=bf*2;
                } else {
                    break;
                }
            } else {
                if (q[bf].q>q[bf*2+1].q){
                    tmpq=q[bf];
                    q[bf]=q[bf*2+1];
                    q[bf*2+1]=tmpq;
                    bf=bf*2+1;
                } else {
                    break;
                }
            }
        }
        count--;
        long long tmp;
        for (long long e=head[now]; e!=-1; e=next[e]){
            tmp=d[now]+leny[e];
            if (d[to[e]]>tmp){
                d[to[e]]=tmp;
                count++;
                q[count].q=tmp;
                q[count].i=to[e];
                for (long long af=count; af>0; af=af/2){
                    if (af/2!=0 && q[af].q<=q[af/2].q){
                        tmpq=q[af];
                        q[af]=q[af/2];
                        q[af/2]=tmpq;
                    } else {
                        break;
                    }
                }
            }
        }
    }
    
    countans=0;
    count=0;
    queue_t q2[n*50];
    long long f[n+1];
    for (long long i=0; i<=n; i++){
        visited[i]=false;
        f[i]=1e17;
        q2[i].q=f[i];
        q2[i].i=i;
        count++;
    }
    f[t]=0;
    q2[0].q=-1e17;
    q2[count].q=f[t];
    q2[count].i=t;
    for (long long i=count; i>0; i=i/2){
        if (i/2!=0 && q2[i].q<=q2[i/2].q){
            tmpq=q2[i];
            q2[i]=q2[i/2];
            q2[i/2]=tmpq;
        } else {
            break;
        }
    }
    for (long long i=0; i<=n; i++){
        int now=q2[1].i;
        q2[1]=q2[count];
        long long bf=1;
        while(1){
            if (bf*2>=count){
                break;
            }
            if (q2[bf*2].q<=q2[bf*2+1].q){
                if (q2[bf].q>q2[bf*2].q){
                    tmpq=q2[bf];
                    q2[bf]=q2[bf*2];
                    q2[bf*2]=tmpq;
                    bf=bf*2;
                } else {
                    break;
                }
            } else {
                if (q2[bf].q>q2[bf*2+1].q){
                    tmpq=q2[bf];
                    q2[bf]=q2[bf*2+1];
                    q2[bf*2+1]=tmpq;
                    bf=bf*2+1;
                } else {
                    break;
                }
            }
        }
        count--;
        long long tmp;
        for (long long e=head[now]; e!=-1; e=next[e]){
            tmp=f[now]+lens[e];
            if (f[to[e]]>tmp){
                f[to[e]]=tmp;
                count++;
                q2[count].q=tmp;
                q2[count].i=to[e];
                for (long long af=count; af>0; af=af/2){
                    if (af/2!=0 && q2[af].q<=q2[af/2].q){
                        tmpq=q2[af];
                        q2[af]=q2[af/2];
                        q2[af/2]=tmpq;
                    } else {
                        break;
                    }
                }
            }
        }
    }
    
    long long ans[n+1];
    ans[0]=0;
    for (int i=1; i<=n; i++){
        ans[i]=d[i]+f[i];
    }
    for (int i=n; i>1; i--){
        if(ans[i]<ans[i-1]){
            ans[i-1]=ans[i];
        }
    }
    for (int i=1; i<=n; i++){
        printf("%lld\n",1000000000000000-ans[i]);
    }
    
	return 0 ;
}


Measured memory_bytes: 21760