#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
const int N=1e5+5;
const long long INF=0x3F3F3F3F3F3F3F3F;
typedef struct Node{
	int idx;
	long long val;
	Node(){}
	Node(int _x,long long _y):idx(_x),val(_y){}
	friend bool operator<(Node x,Node y){ return x.val<y.val; }
} node;
int n,m,s,u,v;
long long dist[N],w;
vector<node> G[N];
priority_queue<int> q;
void dijkstra(){
	q.push(s);
	dist[s]=0;
	while(!q.empty()){
		int now=q.top();
		q.pop();
		for(int i=0;i<G[now].size();i++){
			int next=G[now][i].idx;
			if(dist[now]+G[now][i].val<dist[next]){
				dist[next]=dist[now]+G[now][i].val;
				q.push(next);
			}
		}
	}
}
int main(){
	ios::sync_with_stdio(false);
	memset(dist,0x3F,sizeof(dist));
	cin>>n>>m>>s;
	for(int i=1;i<=m;i++){
		cin>>u>>v>>w;
		G[u].push_back(node(v,w));
	}
	dijkstra();
	for(int i=1;i<=n;i++)
		cout<<dist[i]<<" ";
	cout<<endl;
	return 0;
}