#include <fstream>
#include <queue>
#include <vector>
#include <bitset>
#define inf 1<<30
#define nmax 100005
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n, m, d[nmax],start;
vector<pair<int,int> >v[nmax];
vector<pair<int,int> >::iterator it;
priority_queue<pair<int,int>,vector<pair<int,int> >,greater< pair<int,int> > >heap;
bitset<nmax> uz;

void dijsktra()
{ int x, i, y, z;
    for(i=1;i<=n;i++)
        d[i]=inf;
        d[start]=0;
    heap.push(make_pair(0,start));
    while(!heap.empty())
    {
        x=heap.top().second;
        heap.pop();

        if(uz[x]==1)
            continue;
        uz[x]=1;
        for(it=v[x].begin();it!=v[x].end();it++){
            y=it->first;
            z=it->second;
            if(d[y]>d[x]+z){
             d[y]=d[x]+z;
             heap.push(make_pair(d[y],y));
        }
    }
}
  for(i=1;i<=n;i++)
    if(i!=start)
  {if(d[i]!=inf)
     g<<d[i]<<' ';
  else
    g<<-1<<' ';}
    else
     g<<0<<' ';
}
int main()
{ int i, x, y, c;
    f>>n>>m>>start;
    for(i=1;i<=m;i++)
    { f>>x>>y>>c;
      v[x].push_back(make_pair(y,c));
      v[y].push_back(make_pair(x,c));
    }
    dijsktra();

}