#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#include<cstdio>
using namespace std;
int n,m,s;

struct node{
    int to;
	int data;
};
priority_queue<node> q;
vector<node> adj[200001];
bool operator<(node a, node b){
	return a.data < b.data;
}
int dis[200001];
void dijkstra(int st){
	memset(dis,0x7f,sizeof(dis));
	dis[st] = 0; 
	q.push(node{st,dis[st]});
	while(q.size()){
		node o = q.top();
	    q.pop();
	    int k = o.to;
	    int v = o.data;
		if(v != dis[k]) continue;
		for(int i = 0; i < adj[k].size(); i++){
			int u = adj[k][i].to;
			int d = adj[k][i].data;
			if(dis[u] > dis[k] + d){
				dis[u] = dis[k] + d;
				q.push(node{u,dis[u]});
		}
		}
	}
}
int main(){
	scanf("%d%d%d",&n,&m,&s);
	for(int i = 1; i <= m; i++){
		int u,v,w;
		scanf("%d %d %d",&u,&v,&w);
		adj[u].push_back(node{v,w});
	}
	dijkstra(s);
	for(int i = 1; i <= n; i++){
	   printf("%d ",dis[i]);
	}
	return 0;
}