#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define int long long
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	int M;
	if (N > 0)
		M = A[0].size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(11);
	}
};
initializer _____;

vector< int > dijkstra(graph &G, int s) {
	///stat must have "<"&">"
	///init d=vector<stat>
	vector< int > d(G.size(), LINF);
	d[s] = 0;
	//init q=p-queue<pair<stat,index> >
	priority_queue< pii, vector< pii >, greater< pii > > q;
	q.push(pii(0, s));

	while (!q.empty()) {
		pii p = q.top();
		q.pop();
		if (d[p.second] < p.first)
			continue;
		for (int i = 0; i < G[p.second].size(); i++) {
			edge e = G[p.second][i];
			if (p.first + e.d < d[e.to]) {
				d[e.to] = p.first + e.d;
				q.push(pii(d[e.to], e.to));
			}
		}
	}
	return d;
}

struct SegT {
	vector< ll > container;
	int n;
	void update(int i, ll x) {
		int ii = i + n - 1;
		container[ii] = x;
		while (ii > 0) {
			ii = (ii - 1) / 2;
			//////////////////  update to better one  ////////////////////////
			container[ii] = min(container[2 * ii + 1], container[2 * ii + 2]);
		}
	}
	ll get(int l, int r, int l2 = 0, int r2 = -1, int k = 0) {
		if (r2 == -1)
			r2 = n;
		/////////////////  return worst  //////////////////
		if (r2 <= l || r <= l2)
			return LINF;

		if (l <= l2 && r2 <= r)
			return container[k];
		ll vl = get(l, r, l2, (l2 + r2) / 2, 2 * k + 1);
		ll vr = get(l, r, (l2 + r2) / 2, r2, 2 * k + 2);
		/////////////  return better one  //////////////
		return min(vl, vr);
	}
	SegT(vector< int > &A) {
		n = pow(2, (int)log2(A.size()) + 1);
		container = vector< ll >(2 * n - 1, 0);
		for (int i = 0; i < A.size(); i++)
			update(i, A[i]);
	}
};

int N, M, K, T, Q;
signed main() {
	cin >> N >> M;
	int s, t;
	cin >> s >> t;
	--s;
	--t;
	graph Ga(N), Gb(N);
	rep(i, M) {
		int u, v, a, b;
		cin >> u >> v >> a >> b;
		--u;
		--v;
		Ga[u].push_back(edge(u, v, a));
		Ga[v].push_back(edge(v, u, a));
		Gb[u].push_back(edge(u, v, b));
		Gb[v].push_back(edge(v, u, b));
	}
	vector< int > da = dijkstra(Ga, s);
	vector< int > db = dijkstra(Gb, t);

	vector< int > d(N);
	rep(i, N) d[i] = da[i] + db[i];
	vector< int > ans(N);
	ans[N - 1] = d[N - 1];
	for (int i = N - 2; i >= 0; i--)
		ans[i] = min(ans[i + 1], d[i]);
	rep(i, N) {
		cout << (int)1e15 - ans[i] << endl;
	}
	return 0;
}

Measured memory_bytes: 28976