#include<iostream>

 #include<cstdio>

 #include<cstring>

 using namespace std;

 struct kkk {

     int from,to,v,next;

 }e[];

 int n,m,s,head[],q,w,p,tot,ans[];

 bool vis[];

 void add(int q,int w,int p) {

     e[++tot].from = q;

     e[tot].to = w;

     e[tot].v = p;

     e[tot].next = head[q];

     head[q] = tot;

 }

 void dijkstra(int s) {

     memset(vis,,sizeof(vis));

     ans[s] = ;

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

         int id = ,sum = 0x3f3f;

         for(int j = ;j <= n; j++)

             if(!vis[j] && sum >= ans[j])

                 sum = ans[j],id = j;

         vis[id] = ;

         for(int j = head[id];j;j = e[j].next)

             ans[e[j].to] = min(ans[e[j].to],ans[id] + e[j].v);

     }

 }

 int main() {

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

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

         ans[i] = 0x3f3f3f3f;

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

         scanf("%d%d%d",&q,&w,&p);

         add(q,w,p);

     }

     dijkstra(s);

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

         if(ans[i] == 0x3f3f3f3f) printf("2147483647 ");

         else

             printf("%d ",ans[i]);

     }

     return ;

 }