#include <fstream>
#include <vector>
#include <queue>
#define INF 100000001
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
long long d[101];
bool inCoada[101];
vector <int> C[101],G[101];
int n,p;
struct cmp{
    bool operator()(int x,int y)
    {
        return d[x]>d[y];
    }
};
void dijkstra(int start)
{
    priority_queue <int, vector<int>,cmp> Q;
    Q.push(start);
    d[start]=0;
    inCoada[start]=1;
    while(!Q.empty())
    {
        int x=Q.top();
        inCoada[x]=0;
        Q.pop();
        for(unsigned int i=0;i<G[x].size();++i)
        {
            int j=G[x][i];
            if(d[j]>d[x]+C[x][i])
            {
                d[j]=d[x]+C[x][i];
                if(!inCoada[j])
                {
                    inCoada[j]=1;
                    Q.push(j);
                }
            }
        }
    }
}
int main()
{
    cin>>n>>p;
    int x,y,c;
    while(cin>>x>>y>>c)
    {
        G[x].push_back(y);
        C[x].push_back(c);
    }
    for(int i=1;i<=n;++i)
        d[i]=INF;
    dijkstra(p);
    for(int i=1;i<=n;++i)
        if(d[i]==INF) cout<<"-1 ";
        else cout<<d[i]<<' ';
    return 0;
}