#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_reference<remove_const<decltype(l)>::type>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
    os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os;
}
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;



// Edge構造体を定義する無向グラフ

class GraphE {
public:
    typedef int W_T;
    struct Edge {
        int u, v;
        W_T value;
        Edge(int from = 0, int to = 0, W_T value = 0) :u(from), v(to), value(value) {}
        inline int to(int _v) const { return _v == v ? u : v; }
    };
    size_t n;
    vector<vector<int>> vertex_to;
    vector<Edge> edges;

    GraphE(int n = 1) :n(n), vertex_to(n) { }

    void resize(size_t _n) {
        n = _n;
        vertex_to.resize(_n);
    }
    void connect(int from, int to, W_T val = 0) {
        vertex_to[(size_t)from].push_back((int)edges.size());
        vertex_to[(size_t)to].push_back((int)edges.size());
        edges.emplace_back(from, to, val);
    }
};



int N, M, S, T;
vector<pair<ll, ll>> costs; // [edgeid] => (a,b);
GraphE graph;

ll beginYen = 1e15;

// S -> YEN
// SNK -> T (bfs T->SNK)

vector<ll> mincostS2VYen;
vector<ll> mincostT2VSnk;


int main() {

    scanner >> N >> M >> S >> T;
    --S; --T;
    graph.resize(N);
    graph.edges.reserve(M);
    costs.reserve(M);

    repeat(i, M) {
        ll u, v, a, b;
        // u = rand<ll>(0, N-1);
        // v = rand<ll>(0, N-1);
        // if (u == v || eds.count(make_pair(u,v))) {--i;continue;}
        // a = rand<ll>(1, 9999);
        // b = rand<ll>(1, 9999);
        scanner >> u >> v >> a >> b;
        --u; --v;
        graph.connect(u, v, i);
        costs.emplace_back(a, b);
    }

    mincostS2VYen.resize(N, ll(1e18));
    mincostT2VSnk.resize(N, ll(1e18));

    {
        priority_queue<pair<ll, int>> pque; // cost, idx
        pque.emplace(0ll, S);
        mincostS2VYen[S] = 0;

        while (!pque.empty()) {
            auto p = pque.top(); pque.pop();
            int i = p.second;
            if (mincostS2VYen[i] < -p.first) continue;

            for (int ei : graph.vertex_to[i]) {
                auto edge = graph.edges[ei];
                ll cost = costs[ei].first;
                int to = edge.to(i);
                ll w = mincostS2VYen[i] + cost;
                if (w < mincostS2VYen[to]) {
                    mincostS2VYen[to] = w;
                    pque.emplace(-w, to);
                }
            }
        }
    }
    {
        priority_queue<pair<ll, int>> pque; // cost, idx
        pque.emplace(0ll, T);
        mincostT2VSnk[T] = 0;

        while (!pque.empty()) {
            auto p = pque.top(); pque.pop();
            int i = p.second;
            if (mincostT2VSnk[i] < -p.first) continue;

            for (int ei : graph.vertex_to[i]) {
                auto edge = graph.edges[ei];
                ll cost = costs[ei].second;
                int to = edge.to(i);
                ll w = mincostT2VSnk[i] + cost;
                if (w < mincostT2VSnk[to]) {
                    mincostT2VSnk[to] = w;
                    pque.emplace(-w, to);
                }
            }
        }
    }

    vector<ll> answers(N);
    ll best = 1e18;
    rrepeat(i, N) {
        minset(best, mincostS2VYen[i] + mincostT2VSnk[i]);
        answers[i] = beginYen - best;
    }

    for (ll ans : answers) printer << ans << '\n';


    return 0;
}

Measured memory_bytes: 12416