#include <bits/stdc++.h>
using namespace std;
#define FOR(x,y) for(int i=x;i<=y;i++)
#define int long long
#define endl '\n'
const int N = 11451;
struct EDGE {
	int v;
	int w;
};
struct NOde {
	int u;
	int dis;
	bool operator > (const NOde& a) const {
		return dis > a.dis;
	}
};
vector<EDGE>g[N];
int n, m;
int dis[N];
bool vis[N];
void DijksTra(int s) {
	priority_queue<NOde, vector <NOde>, greater<NOde>>q;
	dis[s] = 0;
	q.push({s, 0});
	while (!q.empty()) {
		int u = q.top().u;
		q.pop();
		if (vis[u])continue;
		vis[u] = 1;
		for (EDGE i : g[u]) {
			int v = i.v, w = i.w;
			if (dis[u] + w < dis[v]) {
				dis[v] = dis[u] + w;
				q.push({v, dis[u] + v});
			}
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int s;
	cin >> n >> m >> s;
	FOR(1, n) dis[i] = INT_MAX;
	FOR(1, m) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u].push_back({v, w});
//		g[v].push_back({u, w});
	}
	DijksTra(s);
	FOR(1, n) {
		cout << dis[i] << ' ';
	}
}

希望大佬能给看看，感激不尽