#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define pb push_back
#define mp make_pair
#define fill(x, y) memset(x, y, sizeof(x))
#define even(x) x % 2 == 0
#define odd(x) x % 2 != 0
#define all(x) x.begin(), x.end()
#define pcnt __builtin_popcount
#define buli(x) __builtin_popcountll(x)
#define F first
#define S second
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

// these functions return the position of result of Binary Search.
#define LB(s, t, x) (int) (lower_bound(s, t, x) - s)
#define UB(s, t, x) (int) (upper_bound(s, t, x) - s)

ll qp(ll a, ll b, int mo) { ll ans = 1; do { if (b & 1) ans = 1ll * ans * a % mo; a = 1ll * a * a % mo; } while (b >>= 1); return ans; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx8[] = { 1, -1, 0, 0, 1, 1, -1, -1 }, dy8[] = { 0, 0, -1, 1, -1, 1, -1, 1 };

template <typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts>
auto make_v(size_t a, size_t b, Ts... ts) { return vector<decltype(make_v<T>(b, ts...))>(a, make_v<T>(b, ts...)); }
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T &t, const V &v) { for (auto &e : t) fill_v(e, v); }
// auto dp = make_v<int>(4, h, w);
// fill_v(dp, 0);

const ll INF_LL = (1ll << 60);
const int INF_INT = (int)1e9;
const ll MOD_CONST = (ll)(1e9 + 7);

template <class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T>
bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }

inline tuple<ll, ll> rotate45(tuple<ll, ll> point) { ll x = get<0>(point), y = get<1>(point); return tuple<ll, ll>(x + y, x - y); }
inline bool rangeCheck2D(int nx, int ny, int Width, int Height) { return nx >= 0 and nx < Width and ny >= 0 and ny < Height; }
void out_sequence(vector<ll> &out) { REP(i, out.size()) { cout << out[i]; if (i == out.size() - 1) cout << endl; else cout << " "; } }

// usage
/* 
	int N, M, start; cin >> N >> M >> start;
	Dijkstra dj(N);
	REP(i, M) {
		int from, to; ll cost; cin >> from >> to >> cost;
		dj.edges[from].pb(Edge(to, cost));
	}

	auto d = dj.get_shortest_path(start);
*/
typedef tuple<int, ll> Edge;
class Dijkstra {
public:
	// edges[from] = Edge(to, cost);
	vector<vector<Edge>> edges;

	Dijkstra(int size) {
		edges = make_v<vector<Edge>>(size);
	}

	vector<ll> get_shortest_path(int start) {
		int node_num = edges.size();
		assert(start < node_num);
		
		typedef tuple<ll, int> P;
		priority_queue<P, vector<P>, greater<P>> que;
		auto d = make_v<ll>(node_num);
		fill_v(d, INF_LL);
		d[start] = 0;
		que.push(P(0, start));
		
		while (not que.empty()) {
			P p = que.top(); que.pop();
			int v = get<1>(p);
			if (d[v] < get<0>(p)) continue;
			REP(i, edges[v].size()) {
				Edge e = edges[v][i];
				int to = get<0>(e); ll cost = get<1>(e);
				ll new_cost = d[v] + cost;
				if (d[to] > new_cost) {
					d[to] = new_cost;
					que.push(P(d[to], to));
				}
			}
		}
		return d;
	}
};

int main(void)
{
	cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(20);

	int N, M, start, t; cin >> N >> M >> start >> t;
	start--; t--;
	Dijkstra djs(N), djt(N);
	REP(i, M) {
		int from, to; ll c1, c2; cin >> from >> to >> c1 >> c2;
		from--; to--;
		djs.edges[from].pb(Edge(to, c1));
		djs.edges[to].pb(Edge(from, c1));
		djt.edges[from].pb(Edge(to, c2));
		djt.edges[to].pb(Edge(from, c2));
	}

	auto stot = djs.get_shortest_path(start);
	auto ttos = djt.get_shortest_path(t);

	vector<ll> q(N);
	REP(i, N) q[i] = stot[i] + ttos[i];
	REPR(i, N-2) if (q[i] > q[i + 1]) q[i] = q[i + 1];
	REP(i, N) {
		ll ans = (ll)1e15;
		ll minC = q[i];
		cout << ans - minC << endl;
	}

	return 0;
}



Measured memory_bytes: 19784