#include <fstream>
#define NMAX 110
#define INF 10000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct varf
{int x,c;
} G [NMAX][NMAX];
int cmin[NMAX],prec[NMAX],start,n,minim,vfmin,d[NMAX];
bool M[NMAX];
void citire();
void dijkstra();
void afisare();
int main()
{ citire();
    dijkstra();
    afisare();
    return 0;
}
void citire ()
{int i,j,c;
    fin>>n>>start;
    while(fin>>i>>j>>c)
    {  d[i]++;
        G[i][d[i]].x=j;
        G[i][d[i]].c=c;
    }
}
void dijkstra()
{ int i,j;
    M[start]=1;
    for(i=1; i<=n; i++)
    {cmin[i]=INF;
    prec[i]=start;
    }
    cmin[start]=prec[start]=0;
    for(i=1; i<=d[start]; i++)
    { cmin[G[start][i].x]=G[start][i].c;
    }
    for(j=1; j<n; j++)
    { minim=INF;
        for(i=1; i<=n; i++)
            if(cmin[i]<minim&&M[i]==0)
            { minim=cmin[i]; vfmin=i;
            }
        if(minim==INF) break;
        M[vfmin]=1;
        for(i=1; i<=d[vfmin]; i++)
            if(M[G[vfmin][i].x]==0&&cmin[G[vfmin][i].x]>minim+G[vfmin][i].c)
            {
                cmin[G[vfmin][i].x]=minim+G[vfmin][i].c ;
                prec[G[vfmin][i].x]=vfmin;
            }
    }
}

void afisare()
{
    int i;
    for(i=1; i<=n; i++)
    {
        if(cmin[i]==INF) fout<<-1<<' ';
        else
            fout<<cmin[i]<<' ';
    }
}