/********************************************************************************
* @author: Wu Zonglin
* @email: mail@wzl1.top
* @date: 2022/2/13 22:39
* @version: 1.0
* @description:
********************************************************************************/
#include <bits/stdc++.h>
#include <vector>
#define INF 2147483647
using namespace std;
typedef struct edge{
    long long v,w,next;
}E;
vector<E> e(50005,{0,0,-1});

vector<int> head(10005,-1);

typedef pair<int,int> pii;//存的是源点到某一点的距离
priority_queue<pii,vector<pii>,greater<pii>>min_heap;//建立优先队列 小根堆
void add_edge(int u,int v,int w){
    e.push_back({v, w, head[u]});
    head[u]=e.size()-1;
}
long long dj[10005];
bool book[10005];
int main(){
    int n,m,si;
    cin>>n>>m>>si;
    for (int i = 0; i < m; ++i) {
        int u,v,w;
        cin>>u>>v>>w;
        add_edge(u,v,w);
    }
    for (int i = 0; i < 10001; ++i) {
        dj[i]=INF;
    }
    min_heap.push(make_pair(0,si));
    dj[si]=0;
//    book[si]= true;
//    for (int i = head[si]; i+1; i=e[i].next) {
//        dj[e[i].v]=e[i].w;
//    }
    while(!min_heap.empty()) {
        int u=min_heap.top().second;
        min_heap.pop();
        book[u]=true;
        for (int j = head[u]; j+1 ; j=e[j].next) {
            int v=e[j].v;
            if(!book[v]&&dj[v]>=dj[u]+e[j].w){
                dj[v]=dj[u]+e[j].w;
                min_heap.push(make_pair(dj[v],v));
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        cout<<dj[i]<<" ";
    }
}