#include <bits/stdc++.h>
#define int long long
#define lint long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define POPCNT(n) (__builtin_popcount(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const lint MOD = 1000000007;
const lint INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

struct edge {
    int to, cost;
    edge(int to, int cost) : to(to), cost(cost) {}
};

int n, m, s, t;
vector<edge> g1[100010];
vector<edge> g2[100010];
int dis1[100010];
int dis2[100010];

void _main() {
    cin >> n >> m >> s >> t;
    s--; t--;
    REP(i, m) {
        int 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<pii, vector<pii>, greater<pii>> que1;
    que1.emplace(0, s);
    MINF(dis1);
    dis1[s] = 0;
    while (!que1.empty()) {
        int dd, v;
        tie(dd, v) = que1.top(); que1.pop();
        if (dis1[v] < dd) continue;
        for (edge e : g1[v]) {
            if (CHMIN(dis1[e.to], dis1[v] + e.cost)) {
                que1.emplace(dis1[e.to], e.to);
            }
        }
    }
    priority_queue<pii, vector<pii>, greater<pii>> que2;
    que2.emplace(0, t);
    MINF(dis2);
    dis2[t] = 0;
    while (!que2.empty()) {
        int dd, v;
        tie(dd, v) = que2.top(); que2.pop();
        if (dis2[v] < dd) continue;
        for (edge e : g2[v]) {
            if (CHMIN(dis2[e.to], dis2[v] + e.cost)) {
                que2.emplace(dis2[e.to], e.to);
            }
        }
    }
    vector<int> ans;
    int tmp = INF;
    for (int i = n - 1; i >= 0; i--) {
        CHMIN(tmp, dis1[i] + dis2[i]);
        ans.push_back((int)1e15 - tmp);
    }
    REV(ans);
    REP(i, n) cout << ans[i] << endl;
}

signed main(signed argc, char **argv) {
    if (argc > 1) {
        if (strchr(argv[1], 'i'))
            freopen("input.txt", "r", stdin);
        if (strchr(argv[1], 'o'))
            freopen("output.txt", "w", stdout);
    }
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    _main();
    return 0;
}

Measured memory_bytes: 20344