#include <iostream>
#include <queue>
#include <cstring>
#define int long long
using namespace std;
priority_queue<int,vector<int>,greater<int> >q;
vector<int>vv[100005],vv2[100005];
int n,m,s,u,v,w,mu[100005],em[100005];
signed main()
{
    cin >> n >> m >> s;
    q.push(s);
    for(int i = 1;i <= m;i ++)
    {
        scanf("%lld%lld%lld",&u,&v,&w);
        vv[u].push_back(v);vv2[u].push_back(w);
    }
    memset(em,0x3f,sizeof(em));
    em[s] = 0;
    while(!q.empty())
    {
        w = q.top();
        q.pop();
        if(mu[w] == 1)continue;
        mu[w] = 1;
        for(int i = 0;i < vv[w].size();i ++)
            if(em[vv[w][i]] > em[w] + vv2[w][i] && mu[vv[w][i]] == 0)
            {
                em[vv[w][i]] = em[w] + vv2[w][i];
                q.push(vv[w][i]);
            }
    }
    for(int i = 1;i <= n;i ++)
	{
		if(em[i] > 1e15)cout << "2147483647 ";
		else cout << em[i] << " ";
	}
}