#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<bitset>
#include<unordered_map>
using namespace std;
//---------------------------------------------------
//ライブラリゾーン！！！！
typedef long long ll;
typedef long double ld;
#define str string
#define rep(i,j) for(ll i=0;i<(long long)(j);i++)
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
const ll gosenchou = 5000000000000000;
short gh[2][4] = { { 0,0,-1,1 },{ -1,1,0,0 } };
struct P {
	ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {//隣接リスト表現
	ll to, cost;
};
struct E {//辺の情報を入れる変数
	ll from, to, cost;
};
bool operator<(E a, E b) {
	return a.cost < b.cost;
}
struct H {
	ll x, y;
};
bool operator<(H a, H b) {
	if (a.x != b.x) return a.x < b.x;
	return a.y < b.y;
}
bool operator>(H a, H b) {
	if (a.x != b.x) return a.x > b.x;
	return a.y > b.y;
}
bool operator==(H a, H b) {
	return a.x == b.x&&a.y == b.y;
}
bool operator!=(H a, H b) {
	return a.x != b.x || a.y != b.y;
}
ll gcm(ll i, ll j) {//最大公約数
	if (i > j) swap(i, j);
	if (i == 0) return j;
	return gcm(j%i, i);
}
ld rad(H a, H b) {
	return sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0));
}//rad＝座標上の2点間の距離
ll ari(ll a, ll b, ll c) {
	return (a + b)*c / 2;
}//等差数列の和
ll fact(ll x, ll k, ll p) {//最大値、個数、あまり
	ll sum = 1;
	for (int i = 0; i < k; i++) {
		sum *= (x--);
		sum %= p;
	}
	return sum;
}//階乗(正）
ll mod_pow(ll x, ll n, ll p) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res*x%p;
		x = x*x%p;
		n >>= 1;
	}
	return res;
}//x^n%p
short ctos(char a) {
	return (int)(a - '0');
}
#define int long long
const long long Inf = 4523372036854775807;
const int inf = 15000000000;
//----------------------------------------------------
//++++++++++++++++++++++++++++++++++++++++++++++++++++
int n, m, s, t;
struct A {
	int to, yen, snk;
};
int a[200000];
int b[200000], c[200000];//yen,snk
vector<A>e[200000];
signed main() {
	cin >> n >> m >> s >> t;
	for (int i = 0; i < m; i++) {
		int u1, u2, u3, u4;
		cin >> u1 >> u2 >> u3 >> u4;
		e[u1].push_back(A{ u2,u3,u4 });
		e[u2].push_back(A{ u1,u3,u4 });
	}
	for (int i = 1; i <= n; i++) {
		b[i] = Inf;
		c[i] = Inf;
	}
	b[s] = 0;
	c[t] = 0;
	priority_queue<P, vector<P>, greater<P>>p;
	p.push(P{ s,0 });
	while (!p.empty()) {
		P t = p.top(); p.pop();
		for (int i = 0; i < e[t.pos].size(); i++) {
			if (b[e[t.pos][i].to] > b[t.pos] + e[t.pos][i].yen) {
				b[e[t.pos][i].to] = b[t.pos] + e[t.pos][i].yen;
				p.push(P{ e[t.pos][i].to,b[e[t.pos][i].to] });
			}
		}
	}
	while (!p.empty()) p.pop();
	p.push(P{ t,0 });
	while (!p.empty()) {
		P t = p.top(); p.pop();
		for (int i = 0; i < e[t.pos].size(); i++) {
			if (c[e[t.pos][i].to] > c[t.pos] + e[t.pos][i].snk) {
				c[e[t.pos][i].to] = c[t.pos] + e[t.pos][i].snk;
				p.push(P{ e[t.pos][i].to,c[e[t.pos][i].to] });
			}
		}
	}
	int ans = 0;
	for (int i = n; i >= 0; i--) {
		a[i] = 1000000000000000 - b[i] - c[i];
		ans = max(ans, a[i]);
		a[i] = ans;
	}
	for (int i = 1; i <= n; i++) {
		cout << a[i] << endl;
	}
}

Measured memory_bytes: 18304