#include<algorithm>
#include<cstring>
#include<vector>
#include<map>
#include<cmath>
#include<cstdio>
#include<queue>
#include<iostream>
typedef long long ll;
const int mod = 1e9+7;
const int maxn = 1000000;
const int inf = 0x3f3f3f3f;
using namespace std;
/*dij堆優化
 
*/ 
struct edge
{
    int to, dis, next;     
};

edge e[maxn];
int head[maxn], dis[maxn], cnt;
bool vis[maxn];
int n, m, s;

inline void add_edge( int u, int v, int d )
{
    cnt++;
    e[cnt].dis = d;
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt;
}

struct node
{
    int dis;
    
 
int pos;
    bool operator <( const node &x )const
    {
        return x.dis < dis;
    }
};

priority_queue<node> q;

inline void dijkstra()
{
    dis[s] = 0;
    q.push( ( node ){0, s} );
    while( !q.empty() )
    {
        node tmp = q.top();
        q.pop();
        int x = tmp.pos ; 
        
        
 
if( vis[x] )
        continue;
        vis[x] = 1;
        
        for( int i = head[x]; i; i = e[i].next )
        {
            int y = e[i].to;
            if( dis[y] > dis[x] + e[i].dis )
            {
                dis[y] = dis[x] + e[i].dis;
                if( !vis[y] )
                {
                    q.push( ( node ){dis[y], y} );
                }
            }
        }
    }
}

 
int main()
{
    cin>>n>>m>>s;
    for(int i = 1; i <= n; ++i)dis[i] = inf;
    
    for( register int i = 0; i < m; ++i )
    {
        register int u, v, d;
        cin>>u>>v>>d;        // u起點 v重點 d權重 
        add_edge( u, v, d );
    }
    
    dijkstra();
    for( int i = 1; i <= n; i++ )
        cout<<dis[i]<<" ";
        cout<<endl;
        
    return 0;
}