#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int inf=1000000000;
int d[100001];
vector<pair<int,int>>x[100001];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
bool v[100001];
int main()
{
    int n,m,i,j,c,p;
    f>>n>>m>>p;
    for(;m;m--)
        f>>i>>j>>c,x[i].push_back(make_pair(j,c)),x[j].push_back(make_pair(i,c));
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[p]=0;
    pq.push(make_pair(p,d[p]));
    while(!pq.empty()) {
        int a=pq.top().first,b=pq.top().second;
        v[a]=1;
        pq.pop();
        for(int i=0;i<x[a].size();i++)
            if(d[x[a][i].first]>b+x[a][i].second&&!v[x[a][i].first])
                d[x[a][i].first]=b+x[a][i].second,pq.push(make_pair(x[a][i].first,d[x[a][i].first]));
    }
    for(int i=1;i<=n;i++)
        if(d[i]==inf)
            g<<-1<<' ';
        else
            g<<d[i]<<' ';
}