#include <bits/stdc++.h>
using namespace std;
const int N=1000005;
int tot=0,head[N];
struct edge{int nxt,to,val;}e[N];
void adde(int u,int v,int w){e[++tot]={head[u],v,w};head[u]=tot;}
bool vis[N];
int dis[N];
struct node{int dis,pos;};
bool operator < (node a,node b){
	return a.dis>b.dis;
}
priority_queue<node> q;
void dj(int s){
	memset(dis,0x3f,sizeof dis);
	dis[s]=0;q.push({0,s});
	while(!q.size()){
		int u=q.top().pos;q.pop();
		if(vis[u])continue;
		vis[u]=1;
		for(int i=head[u];i;i=e[i].nxt){
			int v=e[i].to,w=e[i].val;
			if(dis[v]>dis[u]+w){
				dis[v]=dis[u]+w;
				q.push({dis[v],v});
			}
		}
	}
}
int main(){
	int n,m,s;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);
		adde(u,v,w);
	}
	dj(s);
	for(int i=1;i<=n;i++){
		cout<<dis[i]<<" ";
	}
}