#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);

    ll n,m,s,t;
    cin>>n>>m>>s>>t;
    s--;t--;

    vector<vector<P>> g1(n);
    vector<vector<P>> g2(n);

    rep(i,m){
        ll u,v,a,b;
        cin>>u>>v>>a>>b;
        u--;
        v--;
        g1[u].emplace_back(v,a);
        g1[v].emplace_back(u,a);
        g2[u].emplace_back(v,b);
        g2[v].emplace_back(u,b);
    }

    priority_queue<int, vector<P>, function<bool(P, P)>> q([](P a, P b)->int {
        if(a.second==b.second) {
            return a.first<b.first;
        } else {
            return a.second>b.second;
        }
    });

    Vec d1(n,INF);
    Vec d2(n,INF);

    q.push(mp(s,0));
    d1[s]=0;
    while(!q.empty()){
        P now = q.top();
        q.pop();
        Each(nxt,g1[now.fi]){
            if(chmin(d1[nxt.fi],now.se+nxt.se)){
                q.push(mp(nxt.fi,now.se+nxt.se));
            }
        }
    }

    q.push(mp(t,0));
    d2[t]=0;
    while(!q.empty()){
        P now = q.top();
        q.pop();
        Each(nxt,g2[now.fi]){
            if(chmin(d2[nxt.fi],now.se+nxt.se)){
                q.push(mp(nxt.fi,now.se+nxt.se));
            }
        }
    }

    Vec dp(n,INF);
    per(i,n-1){
        if(i<n-1){
            dp[i] = dp[i+1];
        }
        chmin(dp[i],d1[i]+d2[i]);
    }
    rep(i,n){
        ll ans=1e15;
        ans -= dp[i];
        cout<<ans<<endl;
    }
    
    return  0;
}


Measured memory_bytes: 20344