#include<cstdio>

 #include<cstring>

 #include<iostream>

 using namespace std;

 const int maxn = ;

 int n, m, tot, s;

 long long inf = 0x3f3f;

 int vis[maxn], dis[maxn], e[maxn];

 // vis -> 是否被访问过  dis -> 最短路  e -> 边的编号

 struct node{

     int next, to, from, val;

 } g[maxn];

 inline void add(int u, int v, int w){

     g[++tot].from = u;

     g[tot].next = e[u];

     e[u] = tot;

     g[tot].to = v;

     g[tot].val = w;

 }//邻接表 

 inline void dijkstra(int x){

     memset(vis, , sizeof(vis));

     for(int i = ; i <= n; i++) dis[i] = (i == x ?  : inf);//初始化

     for(int i = ; i <= n; i++){

         int t = , y = inf;

         for(int j = ; j <= n; j++) if(!vis[j] && dis[j] <= y) y = dis[t = j];

         vis[t] = ;

         for(int j = e[t]; j; j = g[j].next) dis[g[j].to] = min(dis[g[j].to], dis[t] + g[j].val);

     }//松弛操作

     for(int i = ; i <= n; i++) {if(dis[i] == 0x3f3f) printf("2147483647 "); else printf("%d ", dis[i]);}

 }

 int main(){

     memset(dis, 0x3f3f, sizeof(dis));

     scanf("%d%d%d", &n, &m, &s);

     for(int i = ; i <= m; i++){

         int u, v, w;

         scanf("%d%d%d", &u, &v, &w);

         add(u, v, w);//单向图

     }

     dijkstra(s);

     return ;

 }