#include<cstdio>
#include<queue>
using namespace std;
#define MAX 100005
#define MAX2 2147483647
int n,m,s,cnt,a,b,c,i,head[MAX];
bool pd[MAX];
long long int ans[MAX];
struct node{
	int to,next,weight;
}inf[MAX];
struct priority{
	int ans;
	int id;
	bool operator <(const priority &x)const
	{
		x.ans<ans;
	}
};
priority_queue<priority> q;
void addnode(int u,int v,int w)
{
	inf[++cnt].to=v;
	inf[cnt].weight=w;
	inf[cnt].next=head[u];
	head[u]=cnt; 
}
void dijkstra()
{
	q.push((priority){0,s});
	while(!q.empty())
	{
		priority temp=q.top();
		q.pop();
		int u=temp.id;
		if(!pd[u])
		{
			pd[u]=1;
			for(i=head[u];i!=0;i=inf[i].next)
			{
				int v=inf[i].to;
				if(ans[v]>ans[u]+inf[i].weight)
				{
					ans[v]=ans[u]+inf[i].weight;
					if(!pd[v]) q.push((priority){ans[v],v}); 
				}
			}
		}
	}
	return ;
}
int main()
{
	scanf("%d%d%d",&n,&m,&s);
	for(i=1;i<=n;i++) ans[i]=MAX2;
	ans[s]=0;
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		addnode(a,b,c);
	}
	dijkstra();
	for(i=1;i<=n;i++) printf("%d ",ans[i]);
	return 0;
}