#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define fst first
#define snd second
#define cauto const auto
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", _dmp_(#__VA_ARGS__, __VA_ARGS__)
void _dmp_(const char*) { cerr << endl; }
template <class T, class... U>
void _dmp_(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; _dmp_(s, y...); }
#else
#define dump(...)
#endif
using ll = long long;
#define int ll
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
#define CONAINER_OUTPUT os << "{"; for (auto const& x : v) os << " " << x; return os << " }";
template <class T> ostream& operator<<(ostream& os, vector<T> const& v) { CONAINER_OUTPUT }
template <class T> ostream& operator<<(ostream& os, deque<T> const& v) { CONAINER_OUTPUT }
template <class T> ostream& operator<<(ostream& os, set<T> const& v) { CONAINER_OUTPUT }
template <class T> ostream& operator<<(ostream& os, multiset<T> const& v) { CONAINER_OUTPUT }
template <class T, class U> ostream& operator<<(ostream& os, map<T,U> const& v) { CONAINER_OUTPUT }
#undef CONAINER_OUTPUT
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct _Init_ { _Init_() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); } } _init_;

template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
#define YesNo(c) ((c) ? "Yes" : "No")
////////////////////////////////
int n,m,s,t;
struct edge { int cost,to; };
vector<vector<edge> > g1,g2;

vector<int> dijkstra(vector<vector<edge> > const& g, int s) {
    vector<int> d(g.size(),-1);
    pque_min<pair<int,int> > q;
    d[s] = 0;
    q.emplace(0,s);
    while (!q.empty()) {
        auto p = q.top(); q.pop();
        const int x = p.snd;
        if (d[x] < p.fst) continue;
        for (edge const& e : g[x]) {
            if (d[e.to] < 0 || d[e.to] > d[x] + e.cost) {
                d[e.to] = d[x] + e.cost;
                q.emplace(d[e.to], e.to);
            }
        }
    }
    return d;
}

int32_t main() {
    cin >> n >> m >> s >> t; s--,t--;
    g1.resize(n); g2.resize(n);
    rep (i,m) {
        int u,v,a,b; cin >> u >> v >> a >> b; u--,v--;
        g1[u].push_back({a,v});
        g1[v].push_back({a,u});
        g2[u].push_back({b,v});
        g2[v].push_back({b,u});
    }
    vector<int> d1 = dijkstra(g1,s);
    vector<int> d2 = dijkstra(g2,t);
    vector<int> d3(n);
    rep (i,n) d3[i] = d1[i] + d2[i];
    repR (i,n-1) chmin(d3[i], d3[i+1]);
    rep (i,n) cout << int(1e15)-d3[i] << "\n";
}


Measured memory_bytes: 19016