#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MAX = 1000000;
using Graph =vector<vector<lint>>;
typedef pair<lint,lint> P;
typedef map<lint,lint> M;
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
 
lint fac[MAX], finv[MAX], inv[MAX];
 
void COMinit() 
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (lint i = 2; i < MAX; i++)
    {
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
 
long long COM(lint n, lint k)
{
    if (n < k)
        return 0;
    if (n < 0 || k < 0)
        return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
 
lint primary(lint num)
{
    if (num < 2) return 0;
    else if (num == 2) return 1;
    else if (num % 2 == 0) return 0;
 
    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (num % i == 0)
        {
            return 0;
        }
    }
 
    return 1;
}
   long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}
    lint lcm(lint a,lint b){
        return a/__gcd(a,b)*b;
    }
     lint gcd(lint a,lint b){
        return __gcd(a,b);
    } 
    const lint maxv=100005;
    struct edge{lint to;lint cost;};
    vector<vector<edge>> x(maxv);
    vector<lint> d(maxv);
    void dijkstra(lint s){    
        priority_queue<P,vector<P>,greater<P>>que;
        fill(all(d),INF);
        d[s]=0;
        que.push(P(0,s));
            while(!que.empty()){
             P p=que.top();que.pop();
             lint v=p.second;
             if(d[v]<p.first)continue;
             rep(i,x[v].size()){
                 edge e=x[v][i];
                 if(d[e.to]>d[v]+e.cost){
                     d[e.to]=d[v]+e.cost;
                     que.push(P(d[e.to],e.to));
                 }
             }   
            }
}
    vector<vector<edge>> x1(maxv);
    vector<lint> d1(maxv);
    void dijkstra2(lint s){    
        priority_queue<P,vector<P>,greater<P>>que;
        fill(all(d1),INF);
        d1[s]=0;
        que.push(P(0,s));
            while(!que.empty()){
             P p=que.top();que.pop();
             lint v=p.second;
             if(d1[v]<p.first)continue;
             rep(i,x1[v].size()){
                 edge e=x1[v][i];
                 if(d1[e.to]>d1[v]+e.cost){
                     d1[e.to]=d1[v]+e.cost;
                     que.push(P(d1[e.to],e.to));
                 }
             }   
            }
}
    int main(){
        lint n,m,s,t;
        cin>>n>>m>>s>>t;
        --s;--t;
        rep(i,m){
            lint u,v,a,b;
            cin>>u>>v>>a>>b;
            --u;--v;
            x[u].push_back({v,a});
            x[v].push_back({u,a});
            x1[u].push_back({v,b});
            x1[v].push_back({u,b});
        }
        dijkstra(s);
        dijkstra2(t);
        priority_queue<lint> que;
        lint mon=pow(10,15);
        vector<lint> ans;
        repm(i,n){
            que.emplace(mon-d[i]-d1[i]);
            ans.push_back(que.top());
        }
        repm(i,n)cout<<ans[i]<<endl;

    }
      

Measured memory_bytes: 22372