#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

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

const int NMAX = 50005;
const int oo = (1 << 30);
int n, m;
int D[NMAX];
bool InCoada[NMAX];

vector < pair < int, int> > G[NMAX];

struct comparaDistante {

    bool operator()(int x, int y) {

        return D[x] > D[y];
    }
};

priority_queue < int, vector < int >, comparaDistante > Coada;

void Citire() {

    fin >> n >> m;
    for(int i = 1; i<= n; i++) {
        int x, y, c;
        fin >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
    }
}

void Afisare() {

    for(int i = 2; i <= n; i++) {
        if(D[i] != oo) {
            fout << D[i] << ' ';
        } else {

            fout << "0 ";
        }
    }
}

void Dijkstra(int nodStart) {

    for(int i = 1; i <= n; i++) {
        D[i] = oo;
    }
    D[nodStart] = 0;
    Coada.push(nodStart);
    InCoada[nodStart] = true;

    while(!Coada.empty()) {

        int nodCurent = Coada.top();
        Coada.pop();
        InCoada[nodCurent] = false;
        for(unsigned i = 0; i < G[nodCurent].size(); i++) {
            int Vecin = G[nodCurent][i].first;
            int Cost = G[nodCurent][i].second;
            if(D[nodCurent] + Cost < D[Vecin]) {
                D[Vecin] = D[nodCurent] + Cost;
                if(InCoada[Vecin] == false) {

                    Coada.push(Vecin);
                InCoada[Vecin] = true;
                }
            }
        }
    }
}

int main()
{
    Citire();
    Dijkstra(m);
    Afisare();
    return 0;
}