#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5 + 10;
struct node {
	int to, w;
};
vector<node> g[N];
int dis[N], vis[N];
void dijkstra(int n, int s) {
	memset(dis, 0x3f, sizeof dis);
	dis[s] = 0;
	for (int i = 1; i <= n; i++) {
		int u = 0;
		int mins = 0x3f3f3f3f;
		for (int j = 1; j <= n; j++) {
			if (!vis[j] && dis[j] < mins) {
				u = j;
				mins = dis[j];
			}
		}
		vis[u] = true;
		for (auto v : g[u]) {
			int to = v.to, w = v.w;
			if (dis[to] > dis[u] + w) {
				dis[to] = dis[u] + w;
			}
		}
	}
}
signed main()
{
	int n, m, s;
	cin >> n >> m >> s;
	for (int i = 1; i <= m; i++) {
		int u, v, l;
		cin >> u >> v >> l;
		g[u].push_back({v, l});
		g[v].push_back({u, l});
	}
	dijkstra(n, s);
	for (int i = 1; i <= n; i++) {
		cout << dis[i] << ' ';
	}
	return 0;
}