#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
typedef pair<int,int>p; 
const int N=500005;
int e[N],ne[N],h[N],w[N],idx;
bool vis[N];
int dis[N];
void dijkstra(int k,int n){
	memset(dis,0x3f,sizeof dis);
	memset(vis,false,sizeof vis);
	priority_queue<p,vector<p>,greater<p> >heap;
	dis[k]=0;
	heap.push({0,k});
	while(heap.size()){
		p t=heap.top();
		heap.pop();
		int ver=t.second,s=t.first;
		if(vis[ver])continue;
		vis[ver]=true;
		for(int i=h[ver];i!=-1;i=ne[i]){
			int j=e[i];
			if(dis[j]>s+w[i]){
				dis[j]=s+w[i];
				heap.push({dis[j],j});
			}
		}
	}
}
void add(int x,int y,int s){
	w[idx]=s,e[idx]=y,ne[idx]=h[x];
	h[x]=idx++;
}
int main(){
	int n,m,k,x,y,s;
	memset(h,-1,sizeof h);
	cin>>n>>m>>k;
	for(int i=0;i<m;++i){
		cin>>x>>y>>s;
		add(x,y,s);
	}
	dijkstra(k,n);
	for(int i=1;i<=n;++i)cout<<dis[i]<<" ";
	return 0;
}