#include<iostream>
#include<cstring>
#include<queue>
const int N=1e5+90;
using namespace std;
priority_queue< pair<int, int> > q;
int n,m,s,to[N],edge[N],head[N],next[N],cnt,d[N],v[N];
void add(int u,int v,int w)
{
	to[++cnt]=v;
	edge[cnt]=w;
	next[cnt]=head[u];
	head[u]=cnt;
}
void dij()
{
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	d[s]=0;		
	q.push(make_pair(0,s));
	while(q.size())
	{
		int x=q.top().second;
		q.pop();
		if(v[x])
		{
			continue;
		}
		v[x]=1;
		for(int i=head[x];i;i=next[i])
		{
			int y=to[i],z=edge[i];
			if(d[y]>d[x]+z)
			{
				d[y]=d[x]+z;
				q.push(make_pair(-d[y],y));
			}
		}	
	}
}
int main()
{
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++)
	{
		int u,v,w;
		cin>>u>>v>>w;
		add(u,v,w);
	}
	dij();
	for(int i=1;i<=n;i++)
	{
		cout<<d[i]<<" ";
	}
	return 0;
}