#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<queue>
#include<utility>
#define mp(x,y) make_pair(x,y)
using namespace std;
const int N=1e4+5,M=5e5+5;
int n,m,s;
int head[N],to[M],nxt[M],val[M],cnt;
int dis[N],vis[N];
priority_queue<pair<int ,int > > q;
void add(int u,int v,int w)
{
	to[++cnt]=v;
	val[cnt]=w;
	nxt[cnt]=head[u];
	head[u]=cnt;
}
void dijkstra()
{
	memset(dis,0x3f,sizeof(dis));
	dis[s]=0;
	q.push(mp(0,s));
	while(!q.empty())  //q.size()
	{
		int u=q.top().second;
		q.pop();
		if(vis[u]) continue;
		vis[u]=true;
		for(int i=head[u];i;i=nxt[i])
		{
			int v=to[i],w=val[i];
			if(dis[v]>dis[u]+w)
			{
				dis[v]=dis[u]+w;
				q.push(mp(-dis[v],v));
			}
		}
		
	}
}
int main()
{
    cin>>n>>m>>s;
    while(m--)
    {
    	int u,v,w;
    	cin>>u>>v>>w;
    	add(u,v,w);
	}
	dijkstra();
	for(int i=1;i<=n;++i)
	{
		if(dis[i]==0x3f3f3f3f) 
		    cout<<0x7fffffff<<' ';
		else
		    cout<<dis[i]<<' ';
	}
	return 0;
}