#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size())cout << a[i] << " ";cout << "\n"
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ld pi = 3.14159265358;
const ll mod = 1000000007;
typedef pair<ll,ll> P;
using graph = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b){if(a < b){a = b; return true;}return false;}
template<class T> inline bool chmin(T& a, T b){if(a > b){a = b; return true;}return false;}
template<class T> inline bool change(T a,T b){if(a > b){swap(a,b);return true;}return false;}
ll gcd(ll a,ll b){
    if(a < b)swap(a,b);
    if(a % b == 0)return b;
    else return gcd(b,a%b);
}
//素数判定O(sqrt(N))
bool isp(ll n){
    bool res = true;
    if(n == 1)return false;
    else{
        for(ll i = 2;i * i <= n;i++){
            if(n % i == 0){
                res = false;
                break;
            }
        }
        return res;
    }
}
const ll cmax = 1000000;
ll fac[cmax], finv[cmax], inv[cmax];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < cmax; 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;
    }
}

// 二項係数計算
ll nCk(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
//nのm乗をMODで割ったあまりO(logN)
ll modpow(ll n,ll m,ll MOD){
    ll res = 1;
    while(m){
        if(m & 1)res = (res * n) % MOD;
        m >>= 1;
        n *= n;
        n %= MOD;
    }
    return res;
}

//printf("%.10f\n", N);
/*  vector<ll> vec = {1,2,5,6,8,9,10};
    cout << binary_search(all(vec),5) << endl; -> true*/
/*
    vector<ll> vec = {1,2,5,6,8,9,10};
    auto n = upper_bound(all(vec),4);
    cout << *n << endl; -> 5*/

//    cout << fixed << setprecision(15);
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll N,M,S,T;
    cin >> N >> M >> S >> T;S--;T--;
    struct edge{ll to,yen,snuk;};
    vector<edge> es[100005];
    ll a,b,y,s;
    rep(i,M){
        cin >> a >> b >> y >> s;
        a--;b--;
        es[a].push_back({b,y,s});
        es[b].push_back({a,y,s});
    }
    vector<ll> YEN(N,INF),SNU(N,INF);
    YEN[S] = 0;SNU[T] = 0;
    priority_queue<P,vector<P>,greater<P>> que;
    que.push(P(0,S));
    while(que.size()){
        P p = que.top();que.pop();
        if(p.first > YEN[p.second])continue;
        for(auto x : es[p.second]){
            if(p.first + x.yen < YEN[x.to]){
                YEN[x.to] = p.first + x.yen;
                que.push(P(YEN[x.to],x.to));
            }
        }
    }
    que.push(P(0,T));
    while(que.size()){
        P p = que.top();que.pop();
        if(p.first > SNU[p.second])continue;
        for(auto x : es[p.second]){
            if(p.first + x.snuk < SNU[x.to]){
                SNU[x.to] = p.first + x.snuk;
                que.push(P(SNU[x.to],x.to));
            }
        }
    }
    vector<ll> cost(N);
    rep(i,N){
        cost[i] = YEN[i] + SNU[i];
    }
    vector<ll> ans(N,INF);ans[N - 1] = cost[N - 1];
    for(ll i = N - 2;i >= 0;i--){
        ans[i] = min(ans[i + 1],cost[i]);
    }
    rep(i,N)printf("%lld\n",1000000000000000LL - ans[i]);
}

Measured memory_bytes: 15912