////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include "bits/stdc++.h"
using namespace std;

// -- loop macros -- //
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (int)(s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define FOREACH(i,container) for (auto &&i : container)
#define allof(c) c.begin(), c.end()
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)

// -- functors -- //
#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }

#define PRED(a,exp) [&](const auto & a) -> bool { return exp; }
#define COMP(a,b,exp) [&](const auto & a, const auto & b) -> bool { return exp; }
#define CONV1(a,exp) [&](const auto & a) -> auto { return exp; }
#define CONV2(a,b,exp) [&](const auto & a, const auto & b) -> auto { return exp; }
#define CONV3(a,b,c,exp) [&](const auto & a, const auto & b, const auto & c) -> auto { return exp; }

// -- typedefs -- //
#define EPS 1e-9

typedef unsigned int uint;
typedef long long llong;
typedef unsigned long long ullong;

// -- I/O Helper -- //
struct _Reader { _Reader(istream &cin) :cin(cin) {} istream &cin; template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { _Writer(ostream &cout) :cout(cout) {} ostream &cout; bool f{ false }; template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; (_Reader{cin}), __VA_ARGS__
#define WRITE(...) (_Writer{cout}), __VA_ARGS__; cout << '\n'
#define DEBUG(...) (_Writer{cerr}), __VA_ARGS__; cerr << '\n'

// -- vevector -- //
template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

namespace std {
	template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
	template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
}

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T> struct iter_pair_t { T beg, end; };
template <class T> iter_pair_t<T> iter_pair(T beg, T end) { return iter_pair_t<T>{beg, end}; }
template <class T> ostream & operator << (ostream &out, const iter_pair_t<T> &v) { if (v.beg != v.end) { out << ++v.beg; while (v.beg != v.end) { out << " " << ++v.beg; } } return out; }
template <class T1> ostream & operator << (ostream &out, const vector<T1> &v) { return out << iter_pair(begin(v), end(v)); }

// -- etc -- //
template <class T> T infinity_value();
#define DEFINE_INFINITY_VALUE(T, val) template <> constexpr T infinity_value<T>() { return (val); }
DEFINE_INFINITY_VALUE(int, 1 << 28);
DEFINE_INFINITY_VALUE(uint, 1u << 28);
DEFINE_INFINITY_VALUE(llong, 1ll << 60);
DEFINE_INFINITY_VALUE(ullong, 1ull << 60);
DEFINE_INFINITY_VALUE(double, HUGE_VAL);
DEFINE_INFINITY_VALUE(float, HUGE_VAL);
#define INF(T) infinity_value<T>()

inline int sign_of(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
template <class TInt> bool in_range(TInt val, TInt min, TInt max) { return val >= min && val < max; }
template <> bool in_range<double>(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
template <> bool in_range<float>(float val, float min, float max) { return val - min > -EPS && val - max < EPS; }
template <class TInt> bool in_range2d(TInt x, TInt y, TInt w, TInt h) { return x >= 0 && x < w && y >= 0 && y < h; }
vector<int> iotavn(int start, int count) { vector<int> r(count); iota(allof(r), start);	return r; }


//// start up ////
void solve();
int main()
{
	//// for local debugging
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);

	//auto classic_table = ctype<char>::classic_table();
	//vector<ctype<char>::mask> ctable(classic_table, classic_table + ctype<char>::table_size);
	//ctable[':'] |= ctype_base::space; // as delimitor
	//ctable[','] |= ctype_base::space; // as delimitor
	//cin.imbue(locale(cin.getloc(), new ctype<char>(ctable.data())));

	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed;
	cout << setprecision(std::numeric_limits<double>::max_digits10);
	solve();

	return 0;
}

////////////////////
/// template end ///
////////////////////


template <class TCost>
struct Edge
{
	int from;
	int to;
	TCost cost;
	bool operator < (const Edge &rhs) const { return cost < rhs.cost; }
	bool operator > (const Edge &rhs) const { return cost > rhs.cost; }
};

// -- ダイクストラ法 -- //
// O(E+VlogV)
template <class TCost>
struct DijkstraResult
{
	int start;
	int goal;
	vector<int> parentNode;
	vector<TCost> costToNode;

	vector<int> BuildPath()
	{
		assert(goal != -1);
		vector<int> result;
		int cur = goal;
		while (cur != start)
		{
			result.push_back(cur);
			cur = parentNode[cur];
		}
		result.push_back(start);
		return result;
	}
};

template <class TCost>
DijkstraResult<TCost> Dijkstra(const vevector<Edge<TCost>> &g, int start = 0, int goal = -1)
{
	typedef Edge<TCost> E;

	int N = g.size();
	priority_queue<E, vector<E>, greater<E>> q;

	q.push(E{ start, start, 0 });

	vector<int> prev(N, -1);
	vector<TCost> cost(N, INF(TCost));
	while (!q.empty())
	{
		E p = q.top(); q.pop();
		if (prev[p.to] != -1) continue;
		prev[p.to] = p.from;
		cost[p.to] = p.cost;
		if (p.to == goal) { break; }

		for (const E &e : g[p.to])
		{
			if (prev[e.to] == -1)
			{
				q.push(E{ e.from, e.to, e.cost + p.cost });
			}
		}
	}
	return DijkstraResult<TCost> { start, goal, prev, cost };
}

template<class T, class TParentFunc>
struct SegTreeT
{
	int size;
	vector<T> tree;
	TParentFunc parent;
	T initialValue;
	static constexpr unsigned int msb(unsigned int v) { REP(i, 5) v |= v >> (1 << i); return (v >> 1) + 1; }

	SegTreeT(int count, TParentFunc parentBuilder, T initialFill)
		: size(msb(count - 1) << 1)
		, tree(size * 2)
		, parent(parentBuilder)
		, initialValue(initialFill)
	{
		fill(partof(tree, size, size), initialFill);
		rebuild();
	}

	// []を使うと更新されないのでrebuildすること。数が少なければupdateの方がよい。
	T& operator[](int i) { return tree[i + size]; }
	void rebuild() { RREP(i, size) { tree[i] = parent(tree[i * 2], tree[i * 2 + 1]); } }

	void update(int index, T value)
	{
		tree[index + size] = value;
		for (int i = (index + size) / 2; i > 0; i /= 2)
			tree[i] = parent(tree[i * 2], tree[i * 2 + 1]);
	}

	T query(int s, int e, int i, int l, int r, T value)
	{
		if (r <= s || e <= l) return value;
		if (s <= l && r <= e) return parent(value, tree[i]);
		value = query(s, e, i * 2, l, (l + r) / 2, value);
		value = query(s, e, i * 2 + 1, (l + r) / 2, r, value);
		return value;
	}

	T query(int begin, int end, T initialValue) { return query(begin, end, 1, 0, size, initialValue); }
	T query(int begin, int end) { return query(begin, end, initialValue); }
};

template<class T = int, class TParentFunc = const T& (*)(const T&, const T&)>
SegTreeT<T, TParentFunc> SegTree(int N, TParentFunc f = min, T initialValue = INF(T))
{
	return SegTreeT<T, TParentFunc>(N, f, initialValue);
}

void solve()
{
	READ(int, n, m, s, t); s--; t--;

	vevector<Edge<llong>> graphS(n), graphT(n);
	REP(i, m)
	{
		READ(int, u, v, a, b); u--; v--;
		graphS[u].push_back({ u,v,a });
		graphS[v].push_back({ v,u,a });
		graphT[u].push_back({ u,v,b });
		graphT[v].push_back({ v,u,b });
	}
	auto resultS = Dijkstra(graphS, s);
	auto resultT = Dijkstra(graphT, t);

	auto tree = SegTree(n, CONV2(a,b,min(a,b)), INF(llong));
	REP(i, n) { tree[i] = resultS.costToNode[i] + resultT.costToNode[i]; }
	tree.rebuild();

	REP(i, n)
	{
		WRITE(1000000000000000ll - tree.query(i, n));
	}

}



Measured memory_bytes: 23352