#include <bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n, m, s, t;
vector<pair<li, PI>> edge[100100];

li ds[100100];
li dt[100100];


int main() {
    cin >> n >> m >> s >> t;
    s--;
    t--;
    rep(i, m) {
        li u, v, a, b;
        cin >> u >> v >> a >> b;
        u--;
        v--;
        edge[u].pb({v, {a, b}});
        edge[v].pb({u, {a, b}});
    }

    // dijkstra from s
    rep(i, n) {
        ds[i] = INF;
        dt[i] = INF;
    }
    {
        priority_queue<PI> pq;
        pq.emplace(0, s);
        while (!pq.empty()) {
            li now_cost = -pq.top().F;
            li now = pq.top().S;
            pq.pop();
            if (ds[now] <= now_cost) {
                continue;
            }
            ds[now] = now_cost;
            rep(i, sz(edge[now])) {
                li next = edge[now][i].F;
                pq.emplace(- now_cost - edge[now][i].S.F, next);
            }
        }
    }
    {
        priority_queue<PI> pq;
        pq.emplace(0, t);
        while (!pq.empty()) {
            li now_cost = -pq.top().F;
            li now = pq.top().S;
            pq.pop();
            if (dt[now] <= now_cost) {
                continue;
            }
            dt[now] = now_cost;
            rep(i, sz(edge[now])) {
                li next = edge[now][i].F;
                pq.emplace(- now_cost - edge[now][i].S.S, next);
            }
        }
    }
    vector<li> res(n);
    res[n - 1] = ds[n - 1] + dt[n - 1];
    for (li i = n - 2; i >= 0; i--) {
        //
        res[i] = min(res[i + 1], ds[i] + dt[i]);
    }
    rin{
        cout << 1000000000000000 - res[i] << endl;
    }
    return 0;
}

Measured memory_bytes: 18628