#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double;  using pll = pair<ll, ll>;
using vl = vector<ll>; using vll = vector<vl>; using vpll = vector<pll>;
using vs = vector<string>; using tll = tuple<ll, ll, ll>; using vtll = vector<tll>;
const ld PI = 3.1415926535897932;
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)
#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define mp make_pair
#define mt make_tuple
void in() {}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
	cerr << " " << h;
	if (sizeof...(t) > 0) cerr << " :";
	debug_out(t...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> vec) {
	for (size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}
bool pairCompare(const pll firstElof, pll secondElof)
{
	return firstElof.first > secondElof.first;
}
//**Snippetリスト**//
//rep, vin, all, iteLoop, bitSearch, bitList, nod//
//gcdlcm, isPrime, eratos, primeFactorize, Npow, combination, divisor, modinv,  digitDP//
//dfs, bfs, dijkstra, WarshallFloyd, BellmanFord, UnionFind, Kruskal ,RMQ, LCA//
ll i, j, k, l; ll N, M, K, H, W, L, X, Y, Z, R, Q;
ll MOD = 1000000007; ll INF = 1LL << 60; ll ans = 0; ll z = 0, o = 1;
vl flag; vector<vpll> path, path2; vl D1, D2;
//***********//
void dijkstra(ll s) {
	priority_queue<pll> PQ;
	vl color(N);
	for (ll i = 0; i < N; i++) {
		D1[i] = INF;
		color[i] = 0;
	}
	D1[s] = 0;
	PQ.push(make_pair(0, s));
	color[s] = 1;
	ll q = -1;
	while (!PQ.empty()) {
		pll f = PQ.top();
		PQ.pop();
		ll u = f.second;
		color[u] = 2;
		if (D1[u] < f.first * q) {
			continue;
		}
		for (ll j = 0; j < path[u].size(); j++) {
			ll v = path[u][j].first;
			if (color[v] == 2) {
				continue;
			}
			if (D1[v] > D1[u] + path[u][j].second) {
				D1[v] = D1[u] + path[u][j].second;
				color[v] = 1;
				PQ.push(make_pair(D1[v] * q, v));
			}
		}
	}
}
void dijkstra2(ll s) {
	priority_queue<pll> PQ;
	vl color(N);
	for (ll i = 0; i < N; i++) {
		D2[i] = INF;
		color[i] = 0;
	}
	D2[s] = 0;
	PQ.push(make_pair(0, s));
	color[s] = 1;
	ll q = -1;
	while (!PQ.empty()) {
		pll f = PQ.top();
		PQ.pop();
		ll u = f.second;
		color[u] = 2;
		if (D2[u] < f.first * q) {
			continue;
		}
		for (ll j = 0; j < path2[u].size(); j++) {
			ll v = path2[u][j].first;
			if (color[v] == 2) {
				continue;
			}
			if (D2[v] > D2[u] + path2[u][j].second) {
				D2[v] = D2[u] + path2[u][j].second;
				color[v] = 1;
				PQ.push(make_pair(D2[v] * q, v));
			}
		}
	}
}
int main() {
	ll S, T;
	cin >> N >> M >> S >> T;
	S--; T--;
	path.resize(N);
	path2.resize(N);
	D1.resize(N);
	D2.resize(N);
	//円状態を0~N-1,スヌーク状態をN~2N-1
	for (i = 0; i < M; i++) {
		ll u, v, a, b;
		cin >> u >> v >> a >> b;
		u--; v--;
		path[u].push_back(mp(v, a));
		path2[u].push_back(mp(v, b));
		path[v].push_back(mp(u, a));
		path2[v].push_back(mp(u, b));
	}
	dijkstra(S);
	dijkstra2(T);
	vl Ans(N+1);
	for (i = 0; i <= N; i++) {
		Ans[i] = INF;
	}
	//debug(D1);
	//debug(D2);
	for (i = N-1; i >= 0; i--) {
		Ans[i] = min(Ans[i + 1],D1[i]+D2[i]);
	}
	for (i = 0; i < N; i++) {
		cout << 1000000000000000 - Ans[i] << endl;
	}
}

Measured memory_bytes: 19240