#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,s,cnt;
ll head[100005],d[5000005];
bool v[1000005];
priority_queue< pair<int, int> > q;
struct edge
{
	ll next,to,data;
}edge[5000005];
void add(ll x,ll y,ll w)
{	++cnt;
	edge[cnt].next=head[x];
	edge[cnt].to=y;
	edge[cnt].data=w;
	head[x]=cnt;
	
}
void dijkstra()
{
	memset(d,0x3f,sizeof(d));
	memset(v,0,sizeof(v));
	d[s]=0;
	q.push(make_pair(0,s));
	while(q.size())
	{
		ll x=q.top().second;
		q.pop();
		if(v[x])continue;
		v[x]=1;
		for(int i=head[x];i;i=edge[i].next)
		{
			int y =edge[i].to;
			int z=edge[i].data;
			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<=n;i++)
		d[i]=0x7fffffff;
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		cin>>x>>y>>z;
		add(x,y,z);
	}
	dijkstra();
	
	for(int i=1;i<=n;i++)
		cout<<d[i]<<' ';
	
return 0;
}