#include<iostream>

 #include<cstdio>

 #include<queue>

 #include<algorithm>

 #include<cmath>

 #include<ctime>

 #include<set>

 #include<map>

 #include<stack>

 #include<cstring>

 #define inf 2147483647

 #define ls rt<<1

 #define rs rt<<1|1

 #define lson ls,nl,mid,l,r

 #define rson rs,mid+1,nr,l,r

 #define N 200010

 #define For(i,a,b) for(register long long i=a;i<=b;i++)

 #define p(a) putchar(a)

 #define g() getchar()

 using namespace std;

 long long n,m,s;

 long long x,y,v;

 bool vis[N];

 struct node{

     long long n;

     long long v;

     node *next;

 }*e[N];

 struct Node

 {

     long long i;

     long long d;

     bool operator < (const Node&temp)const{

         return d>temp.d;

     }

 }a[N];

 priority_queue<Node>q;

 void in(long long &x){

     long long y=;

     char c=g();x=;

     while(c<''||c>''){

         if(c=='-')y=-;

         c=g();

     }

     while(c<=''&&c>=''){

         x=(x<<)+(x<<)+c-'';c=g();

     }

     x*=y;

 }

 void o(long long x){

     if(x<){

         p('-');

         x=-x;

     }

     if(x>)o(x/);

     p(x%+'');

 }

 void push(long long x,long long y,long long v){

     node *p;

     p=new node();

     p->n=y;

     p->v=v;

     if(e[x]==NULL)

         e[x]=p;

     else{

         p->next=e[x]->next;

         e[x]->next=p;

     }

 }

 void hd(){

     a[s].d=;

     q.push(a[s]);

     while(!q.empty()){

         long long t=q.top().i;

         q.pop();

         if(vis[t])continue;

         vis[t]=true;

         for(register node *i=e[t];i;i=i->next){

             if(a[t].d+i->v<a[i->n].d){

                 a[i->n].d=a[t].d+i->v;

                 q.push(a[i->n]);

             }

         }

     }

 }

 int main(){

     in(n);in(m);in(s);

     For(i,,m){

         in(x);in(y);in(v);

         push(x,y,v);

     }

     For(i,,n){

         a[i].i=i;

         a[i].d=inf;

     }

     hd();

     For(i,,n){

         o(a[i].d);

         p(' ');

     }

     return ;

 }