#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int T, n, m, s, t;

typedef ll W;
vector<W> dijkstra(const vector<vector<pair<int, W>>> &g, int s){
    int n = g.size();
    vector<W> ret(n, 1ll << 60);
    priority_queue<pair<W, int>, vector<pair<W, int>>, greater<pair<W, int>> > dp;
    dp.push(pii(0, s));
    ret[s] = 0;
    while(!dp.empty()){
        int s = dp.top().second;
        W c;
        tie(c, s) = dp.top();dp.pop();
        if(ret[s] < c) continue;
        for(const auto &e : g[s]){
            int t = e.first;
            if(chmin(ret[t], ret[s]+e.second)) dp.emplace(ret[t], t);
        }
    }
    return ret;
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    while(cin >> n >> m >> s >> t){
        s --; t--;
        vector<vector<pair<int, ll>>> g(n), rg(n);
        REP(i, m) {
            int u, v, a, b;
            cin >> u >> v >> a >> b; u--; v--;
            g[u].emplace_back(v, a);
            g[v].emplace_back(u, a);
            rg[u].emplace_back(v, b);
            rg[v].emplace_back(u, b);
        }
        vector<ll> d1 = dijkstra(g, s);
        vector<ll> d2 = dijkstra(rg, t);
        vector<ll> ans(n, -1);
        REP(i, n) {
            ans[i] = 1000000000000000ll - d1[i] - d2[i];
        }
        RREP(i, n - 1) ans[i] = max(ans[i], ans[i + 1]);
        REP(i, n) cout << ans[i] << endl;
    }
    return 0;
}


Measured memory_bytes: 19016