#include <fstream>
#include <vector>
#include <queue>
#include <cstring>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int N=5e4+1;

vector< pair<int,int> >v[N];

bool inq[N];
int ans[N];
int n,p,x,y,val;

struct cmp
{
    bool operator()(int x,int y)
    {
        return ans[x]>ans[y];
    }
};

priority_queue<int,vector<int>,cmp>q;

void dijkstra(int start)
{
    memset(ans,-1,sizeof(ans));
    ans[start]=0;
    q.push(start);
    inq[start]=true;
    while(!q.empty())
    {
        int nodCurent=q.top();
        q.pop();
        inq[nodCurent]=false;
        for(size_t i=0;i<v[nodCurent].size();i++)
        {
            int vecin=v[nodCurent][i].first;
            int cost=v[nodCurent][i].second;
            if(cost+ans[nodCurent]<ans[vecin]||(ans[vecin]==-1))
            {
                ans[vecin]=cost+ans[nodCurent];
                if(inq[vecin]==false)
                {
                    q.push(vecin);
                    inq[vecin]=true;
                }
            }
        }
    }
}

int main()
{
    fin>>n>>p;
    while(fin>>x>>y>>val)
    {
        v[x].push_back(make_pair(y,val));
    }
    dijkstra(p);
    for(int i=1;i<=n;i++)
    {
        if(ans[i]!=-1)
        fout<<ans[i]<<" ";
        else fout<<0<<" ";
    }
    return 0;
}