#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int N=1e5+1;

priority_queue<pair<int,int> >q;
int m,n,tot,s;
int head[N],Next[N],ver[N],edge[N],d[N];
bool v[N];

void add(int x,int y,int z)
{
	ver[++tot]=y;
	edge[tot]=z;
	Next[tot]=head[x];
	head[x]=tot;
	return ;
}

void dijkstra(int sx)
{
	memset(d,0x3f,sizeof(d));
	d[sx]=0;
	q.push(make_pair(0,sx));
	while(q.size())
	{
		int x=q.top().second;
		q.pop();
		if(v[x]) continue;
		v[sx]=1;
		for(int i=head[x];i;i=Next[i])
		{
			int y=ver[i],z=edge[i];
			if(d[y]>d[x]+z)
			{
				d[y]=d[x]+z;
				q.push(make_pair(-d[y],y));
			}
		}
	}
	return ;
}

int main()
{
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		add(a,b,c);
	}
	dijkstra(s);
	for(int i=1;i<=n;i++)
	{
		cout<<d[i]<<" ";
	}
	return 0;
}