#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/trie_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define Fixed fixed << setprecision(12)
#define int int_fast64_t
using pii = pair<int,int>;
constexpr int INF  = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9+7;
constexpr int mod2 = 998244353;

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }

template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class T> using max_heap = priority_queue<T>;
template <class A, class B> using umap = unordered_map<A,B>;
template <class T> using Set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class K, class V> using Umap = gp_hash_table<K, V>;
using Trie = trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;

inline int square(int a){ return a * a;}
inline int updiv(int a,int b){ return (a + b - 1) / b; }

constexpr int dx[] = {1,0,-1,0,1,1,-1,-1};
constexpr int dy[] = {0,-1,0,1,1,-1,-1,1};

signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout.setf(ios_base::fixed);
    cout.precision(10);

    int n, m, s, t;
    cin >> n >> m >> s >> t;
    --s, --t;

    vector<vector<tuple<int, int, int> > > graph(n);

    rep(i,m){
        int u, v, a, b;
        cin >> u >> v >> a >> b;
        --u, --v;
        graph[u].emplace_back(v, a, b);
        graph[v].emplace_back(u, a, b);
    } 

    auto Dijkstra = [&](int S, bool k){
        vector<int> min_cost(n, LINF);
        min_heap<pii> pq;
        min_cost[S] = 0;
        pq.emplace(0, S);
        while(!pq.empty()){
            auto [now_cost, now_node] = pq.top();
            pq.pop();
            if(min_cost[now_node] < now_cost) continue;
            for(auto&& [next_node, cost_en, cost_snuke] : graph[now_node]){
                if(chmin(min_cost[next_node], min_cost[now_node] + (k ? cost_en : cost_snuke))){
                    pq.emplace(min_cost[next_node], next_node);
                }
            }
        }
        return (min_cost);
    };

    auto en = Dijkstra(s, true);
    auto snuke = Dijkstra(t, false);

    min_heap<pii> pq;

    rep(i,n){
        pq.emplace(en[i] + snuke[i], i);
    }

    rep(i,n){
        while(pq.top().second < i) pq.pop();
        cout << int(1e15) - pq.top().first << '\n';
    }

    return 0;
}

Measured memory_bytes: 16744