#include <bits/stdc++.h>
using namespace std;
const int maxn=1000005;
const int inf=0x7fffffff;
#define int long long
int n,m,head[maxn],edgesum=0;

struct edge{
	int next,to,w;
}edge[maxn];
void add_edge(int from,int to,int w)
{
	edge[++edgesum].next=head[from];
	edge[edgesum].to=to;
	edge[edgesum].w=w;
	head[from]=edgesum;
}
priority_queue<pair<int,int>>q;
int dis[maxn],v[maxn*10],vis_1;
void dijkstra()
{
	memset(dis,inf,sizeof(dis));
	memset(v,0,sizeof(v));
	dis[vis_1]=0;
	q.push(make_pair(0,1));
	while(q.size())
	{
		int x=q.top().second;
		
		//cout<<x<<":";
		
		q.pop();
		if(v[x]) continue;
		v[x]=1;
		for(int i=head[x];i;i=edge[i].next)
		{
			if(dis[edge[i].to]>dis[x]+edge[i].w)
			{
				dis[edge[i].to]=(dis[x]+edge[i].w);
				q.push(make_pair(-dis[edge[i].to],edge[i].to));
			}
		}
	}
}
signed main()
{
	cin>>n>>m>>vis_1;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		add_edge(u,v,w);
		add_edge(v,u,w);
	}
	dijkstra();
	for(int i=1;i<=n;i++) cout<<(i==vis_1?0:dis[i])<<" ";
	return 0;
}