#include <bits/stdc++.h>
#define PR pair<int, int>
using namespace std;

const int N = 1e5 + 5;
int n, m, s, ans[N];
bool f[N];
struct node{
	int v, w;
};
vector<node> a[N];
void dijkstra()
{
	priority_queue<PR, vector<PR >, greater<PR > > q;
	q.push({s, 0});
	while (q.size())
	{
		PR k = q.top();
		q.pop();
		if (f[k.first])
		{
			continue;
		}
		f[k.first] = 1;
		for (int i = 0; i < a[k.first].size(); i++)
		{
			q.push({a[k.first][i].v, k.second + a[k.first][i].w});
			ans[a[k.first][i].v] = min(ans[a[k.first][i].v], k.second + a[k.first][i].w);
		}
	}
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie();cout.tie();
	cin >> n >> m >> s;
	for (int i = 1; i <= n; i++)
	{
		ans[i] = INT_MAX;
	}
	ans[s] = 0;
	for (int i = 0; i < m; i++)
	{
		int u, v, w;
		cin >> u >> v >> w;
		a[u].push_back((node){v, w});
	}
	dijkstra();
	for (int i = 1; i <= n; i++)
	{
		cout << ans[i] << ' ';
	}
	return 0;
}