#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
 
using namespace std;
typedef long long int ll;
typedef pair <long long int, int> P;
 
//隣接リストを用いた場合　O(|E|log|V|)
 const ll INF=10000000000000000;  //変える
 struct edge {int to, cost1, cost2; }; //cost1は円
 int V;
 
 vector <edge> G[MAX_V];
 ll d1[MAX_V];
 ll d2[MAX_V];
 
 void dijkstra1 (int s){
     //小さい順に取り出す firstは最短距離、secondは頂点の番号
     priority_queue<P, vector<P>, greater<P>> que;
     fill(d1,d1+V,INF);
     d1[s]=0;
     que.push(P(0,s));
     
     while (!que.empty()) {
         P p=que.top();  que.pop();
         int v=p.second;
         if (d1[v]<p.first) continue;
         rep(i,0,G[v].size()){
             edge e=G[v][i];
             if (d1[e.to]>d1[v]+e.cost1){
                 d1[e.to]=d1[v]+e.cost1;
                 que.push(P(d1[e.to], e.to));
             }
         }
     }
 }
 
void dijkstra2 (int s){
    //小さい順に取り出す firstは最短距離、secondは頂点の番号
    priority_queue<P, vector<P>, greater<P>> que;
    fill(d2,d2+V,INF);
    d2[s]=0;
    que.push(P(0,s));
    
    while (!que.empty()) {
        P p=que.top();  que.pop();
        int v=p.second;
        if (d2[v]<p.first) continue;
        rep(i,0,G[v].size()){
            edge e=G[v][i];
            if (d2[e.to]>d2[v]+e.cost2){
                d2[e.to]=d2[v]+e.cost2;
                que.push(P(d2[e.to], e.to));
            }
        }
    }
    
}
 
void solve(){
    int m,s,t;
    cin >> V >> m >> s >> t;
    s--; t--;
    rep(i,0,m){
        int u, v, a, b;
        cin >>u>>v>>a>>b;
        u--; v--;
        G[u].push_back(edge {v,a,b}); G[v].push_back(edge {u,a,b});
    }
    dijkstra1(s);
    dijkstra2(t);
    set<P> st;
    rep(i,0,V){
        st.insert(P(d1[i]+d2[i], i));
    }
	// debug(vector<P>(all(st)));
    rep(i,0,V){
        cout << 1000000000000000ll-(*(st.begin())).first << endl;
		st.erase(P(d1[i] + d2[i], i));
    }
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 15996