#define DM 30001
#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream fi ("sate.in");
ofstream fo ("sate.out");
int n, m, x, y, dist[DM], a, b, d;
queue <int> q;
vector <pair <int, int> > v[DM];

int main()
{
	fi >> n >> m >> x >> y;
	for (int i = 1; i <= m; ++i)
	{
		fi >> a >> b >> d;
		if (a > b)
			swap(a, b);
		v[a].push_back(make_pair(b, d));
		v[b].push_back(make_pair(a, -d));
	}
	q.push(1);
	while(!q.empty())
	{
		a = q.front();
		q.pop();
		for (int i = 0; i < v[a].size(); ++i)
			if (!dist[v[a][i].first] || dist[v[a][i].first] > dist[a] + v[a][i].second)
			{
				dist[v[a][i].first] = dist[a] + v[a][i].second;	
				q.push(v[a][i].first);
			}
	}
	for (int i = 1; i <= n; ++i)
		fo << dist[i] << ' ';
	fo << '\n';
	if (x > y)
		swap(x, y);
	fo << dist[y] - dist[x];
	return 0;
}