// Original C++ solution (slower):
#include <vector>

#include <iostream>

#include <cmath>

#include <map>

#include <unordered_map>

#include <algorithm>

#include <fstream>

#include <unistd.h>

#include <string>

#include <numeric>

#include <queue>

#include <deque>

#include <sstream>

#include <iomanip>

#include <set>

#include <stack>

#include <cassert>

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef vector<vl> vvl;

typedef vector<vvl> vvvl;

typedef vector<vi> vvi;

typedef vector<vvi> vvvi;

typedef vector<bool> vb;

typedef vector<vector<bool>> vvb;

typedef vector<vvb> vvvb;

typedef vector<vvvb> vvvvb;

typedef vector<string> vs;

typedef vector<vector<string>> vvs;

typedef vector<char> vc;

typedef vector<vector<char>> vvc;

typedef vector<double> vd;

typedef vector<vd> vvd;

typedef vector<vvd> vvvd;

typedef pair<int, int> P;

typedef pair<ll, ll> PL;

typedef vector<P> vp;

typedef vector<PL> vpl;

typedef vector<vector<P>> vvp;

typedef vector<vector<PL>> vvpl;

const int INF = 1001001001;

const ll LINF = 1e16;

const double pi = 3.1415926535897932;

const string endstr = "\n";

#define FOR(i, a, b) for(ll i = (a); i < b; i++)

#define RFOR(i, a, b) for(ll i = (a); i > b; i--)

#define REP(i, n) for(ll i = 0; i < n; i++)

#define RREP(i, n) for(ll i = n-1; i > -1; i--)

#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)

#define ff first

#define ss second

#define pb push_back

#define epb emplace_back



template <typename T>

T gcd(T a, T b) {

    return (a == 0) ? b : gcd(b%a, a);

}

template <typename T>

T lcm(T a, T b) {

    return a / gcd(a, b) * b;

}



bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};

bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};

bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};

bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};

template <typename T>

vector<T> uniquen(vector<T> vec){

    vec.erase(unique(vec.begin(), vec.end()), vec.end());

    return vec;

}



struct edge {

    ll to, cost;

    edge(ll to, ll cost){

        this->to = to;

        this->cost = cost;

    }

};



int main(){

    ll N, M, s, t; cin >> N >> M >> s >> t; s--; t--;

    const ll mx = 1e5+100;

    vector<edge> ed_jpy[mx], ed_snu[mx];

    REP(i, M){

        ll u, v, a, b; cin >> u >> v >> a >> b; u--; v--;

        ed_jpy[u].epb(v, a); ed_snu[u].epb(v, b);

        ed_jpy[v].epb(u, a); ed_snu[v].epb(u, b);

    }

    



    vl dist_jpy(N, LINF);

    priority_queue<PL,vector<PL>, greater<PL>> q;

    dist_jpy[s] = 0; q.push({0,s});

    while(!q.empty()){

        auto qq = q.top(); q.pop();

        ll now = qq.ss, dist = qq.ff;

        if(dist > dist_jpy[now]) continue;

        for(auto& e : ed_jpy[now]){

            if(dist_jpy[e.to] > dist + e.cost){

                dist_jpy[e.to] = dist + e.cost;

                q.emplace( dist_jpy[e.to], e.to);

            }

        }

    }



    vl dist_snu(N, LINF);

    priority_queue<PL,vector<PL>, greater<PL>> qs;

    dist_snu[t] = 0; qs.push({0,t});

    while(!qs.empty()){

        auto qq = qs.top(); qs.pop();

        ll now = qq.ss, dist = qq.ff;

        if(dist > dist_snu[now]) continue;

        for(auto& e : ed_snu[now]){

            if(dist_snu[e.to] > dist + e.cost){

                dist_snu[e.to] = dist + e.cost;

                qs.emplace( dist_snu[e.to], e.to);

            }

        }

    }



    map<ll, ll> ans;

    REP(x, N){

        ll d = dist_jpy[x] + dist_snu[x];

        ans[d] = max(ans[d], x+1);

    }

    ll year = 0;

    FORMAP(it, ans){

        if(year == N) break;

        ll dist = 1e15-it->ff;

        ll ye = it->ss;

        while(year < ye){

            cout << dist << endstr;

            year++;

        }

    }

    return 0;

}


// Optimized solution to the same problem (faster):
#include <vector>

#include <iostream>

#include <cmath>

#include <map>

#include <unordered_map>

#include <algorithm>

#include <fstream>

#include <unistd.h>

#include <string>

#include <numeric>

#include <queue>

#include <deque>

#include <sstream>

#include <iomanip>

#include <set>

#include <stack>

#include <cassert>

using namespace std;

typedef long long ll;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef vector<vl> vvl;

typedef vector<vvl> vvvl;

typedef vector<vi> vvi;

typedef vector<vvi> vvvi;

typedef vector<bool> vb;

typedef vector<vector<bool>> vvb;

typedef vector<vvb> vvvb;

typedef vector<vvvb> vvvvb;

typedef vector<string> vs;

typedef vector<vector<string>> vvs;

typedef vector<char> vc;

typedef vector<vector<char>> vvc;

typedef vector<double> vd;

typedef vector<vd> vvd;

typedef vector<vvd> vvvd;

typedef pair<int, int> P;

typedef pair<ll, ll> PL;

typedef vector<P> vp;

typedef vector<PL> vpl;

typedef vector<vector<P>> vvp;

typedef vector<vector<PL>> vvpl;

const int INF = 1001001001;

const ll LINF = 1e16;

const double pi = 3.1415926535897932;

const string endstr = "\n";

#define FOR(i, a, b) for(ll i = (a); i < b; i++)

#define RFOR(i, a, b) for(ll i = (a); i > b; i--)

#define REP(i, n) for(ll i = 0; i < n; i++)

#define RREP(i, n) for(ll i = n-1; i > -1; i--)

#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)

#define ff first

#define ss second

#define pb push_back

#define epb emplace_back



template <typename T>

T gcd(T a, T b) {

    return (a == 0) ? b : gcd(b%a, a);

}

template <typename T>

T lcm(T a, T b) {

    return a / gcd(a, b) * b;

}



bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};

bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};

bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};

bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};

template <typename T>

vector<T> uniquen(vector<T> vec){

    vec.erase(unique(vec.begin(), vec.end()), vec.end());

    return vec;

}



struct edge {ll to, jpy, snu;};



int main(){

    ll N, M, s, t; cin >> N >> M >> s >> t; s--; t--;

    const ll mx = 1e5+100;

    vector<edge> ed[mx];

    REP(i, M){

        ll u, v, a, b; cin >> u >> v >> a >> b; u--; v--;

        ed[u].pb({v, a, b});

        ed[v].pb({u, a, b});

    }

    

    vl dist_jpy(N, LINF);

    priority_queue<PL,vector<PL>, greater<PL>> q;

    dist_jpy[s] = 0; q.push({0,s});

    while(!q.empty()){

        auto qq = q.top(); q.pop();

        ll now = qq.ss, dist = qq.ff;

        if(dist > dist_jpy[now]) continue;

        for(auto e : ed[now]){

            if(dist_jpy[e.to] > dist + e.jpy){

                dist_jpy[e.to] = dist + e.jpy;

                q.push({dist_jpy[e.to], e.to});

            }

        }

    }

    

    vl dist_snu(N, LINF);

    priority_queue<PL,vector<PL>, greater<PL>> qs;

    dist_snu[t] = 0; qs.push({0,t});

    while(!qs.empty()){

        auto qq = qs.top(); qs.pop();

        ll now = qq.ss, dist = qq.ff;

        if(dist > dist_snu[now]) continue;

        for(auto e : ed[now]){

            if(dist_snu[e.to] > dist + e.snu){

                dist_snu[e.to] = dist + e.snu;

                qs.push({ dist_snu[e.to], e.to});

            }

        }

    }

    

    multimap<ll, ll> ans;

    REP(x, N){

        ll d = dist_jpy[x] + dist_snu[x];

        ans.emplace(d, x+1);

    }

    ll year = 0;

    while(year < N){

        ll dist = 1e15 - ans.begin()->ff;

        ll ye = ans.begin()->ss;

        ans.erase(ans.begin());

        while(year < ye){

            cout << dist << endstr;

            year++;

        }

    }

    return 0;

}


// Fastest known solution for this problem: