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

using namespace std;

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

const int NMAX = 50005;
const int INF = (1 << 30);

int n, m;
int D[NMAX];
bool InCoada[NMAX];

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

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

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

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

void dijkstra(int nodS)
{
    for (int i = 1; i <= n; i++)
        D[i] = INF;

    D[nodS] = 0;
    Coada.push(nodS);
    InCoada[nodS] = true;
    while (!Coada.empty()){
        int nodCurent = Coada.top();
        Coada.pop();
        InCoada[nodCurent] = false;

        for (size_t 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;
                }
            }
        }
    }
}

void print()
{
    for (int i = 2; i <= n; i++){
        if (D[i] != INF)
            fout << D[i] << " ";
        else fout << "0 ";
    }
}

int main()
{
    read();
    dijkstra(1);
    print();
    return 0;
}