#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
const long double pi = acos(-1);
const long double eps = 1e-10;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

using dat = pair<ll, int>;
int main() {
    init();

    int n, m, s, t; cin >> n >> m >> s >> t;
    --s, --t;
    vector<vector<dat>> yen(n), snuuk(n);
    FOR(i, 0, m) {
        int v, u; ll a, b; cin >> v >> u >> a >> b;
        --v, --u;
        yen[v].emplace_back(a, u);
        yen[u].emplace_back(a, v);
        snuuk[v].emplace_back(b, u);
        snuuk[u].emplace_back(b, v);
    }

    VL ydis(n, LLINF), sdis(n, LLINF);
    ydis[s] = 0, sdis[t] = 0;
    PQ<dat> dik;
    dik.emplace(0, s);
    while (!dik.empty()) {
        ll d; int now;
        tie(d, now) = dik.top(); dik.pop();
        if (ydis[now] < d)continue;
        each(next, yen[now]) {
            ll cost; int to;
            tie(cost, to) = next;
            if (!chmin(ydis[to], ydis[now] + cost))continue;
            dik.emplace(ydis[to], to);
        }
    }
    dik.emplace(0, t);
    while (!dik.empty()) {
        ll d; int now;
        tie(d, now) = dik.top(); dik.pop();
        if (sdis[now] < d)continue;
        each(next, snuuk[now]) {
            ll cost; int to;
            tie(cost, to) = next;
            if (!chmin(sdis[to], sdis[now] + cost))continue;
            dik.emplace(sdis[to], to);
        }
    }

    priority_queue<dat> ans;
    FOR(i, 0, n) {
        ll cost = 1000000000000000LL - ydis[i] - sdis[i];
        ans.emplace(cost, i);
    }

    FOR(i, 0, n) {
        while (ans.top().second < i)ans.pop();
        cout << ans.top().first << "\n";
    }
}


Measured memory_bytes: 20340