#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;

const int N = 20010;
long long h[N], e[N], ne[N], w[N], idx;
long long dist[N];
typedef pair<long long, long long>PII;
int n, m, s;
bool st[N];

void add(long long a, long long b, long long c)
{
	ne[idx] = h[a];
	e[idx] = b;
	w[idx] = c;
	h[a] = idx++;
}

void dijkstra()
{
	memset(dist, 0x3f, sizeof(dist));
	priority_queue<PII, vector<PII>, greater<PII>>heap;
	heap.push({ 0,s });
	dist[s] = 0;
	while (heap.size())
	{
		PII t = heap.top();
		heap.pop();
		long long ver = t.second;
		long long distance = t.first;
		if (st[ver])continue;
		st[ver] = true;
		for (long long i = h[ver]; i != -1; i = ne[i])
		{
			long long j = e[i];
			if (dist[j] > distance + w[i])
			{
				dist[j] = distance + w[i];
				heap.push({ dist[j],j });
			}
		}
	}
}
int main()
{
	memset(h, -1, sizeof(h));
	cin >> n >> m >> s;
	for (long long i = 0; i < m; i++)
	{
		long long a, b, c;
		cin >> a >> b >> c;
		add(a, b, c);
	}
	dijkstra();
	for (long long i = 1; i <= n; i++)
		cout << dist[i] << " ";
	return 0;
}