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

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m, k, Heap_Size;
vector < pair <int, int> > G[50005];
int Fort[50005], A[50005], Heap[50005];
int D[50005];
int const oo = 1000000000;

void citire()
{
    int i, x, y, c;
    f>>n>>m;
    Heap_Size = n;

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

void Swap(int x, int y)
{
    swap(A[Heap[x]], A[Heap[y]]);
    swap(Heap[x], Heap[y]);
}

void UpHeap(int pos)
{
    int TT = pos/2;
    if(TT && D[Heap[TT]] > D[Heap[pos]]){
        Swap(TT, pos);
        UpHeap(TT);
    }
}

void DownHeap(int pos)
{
    int son = 2*pos;
    if(son + 1 <= Heap_Size && D[Heap[son]] > D[Heap[son+1]])
        son++;
    if(son <= Heap_Size && D[Heap[son]] < D[Heap[pos]]){
        Swap(son, pos);
        DownHeap(son);
    }
}

void Dijkstra()
{
    int i, nod, vecin, cost;

    for(i=1; i<=n; i++){
        D[i] = oo;
        A[i] = i;
        Heap[i] = i;
    }

    D[1] = 0;

    while(Heap_Size)
    {
        nod = Heap[1];
        Swap(1, Heap_Size);
        Heap_Size--;
        DownHeap(1);

        for(i=0; i<G[nod].size(); i++){
            vecin = G[nod][i].first;
            cost = G[nod][i].second;
            if(D[nod] + cost < D[vecin]){
                D[vecin]  = D[nod] + cost;
                UpHeap(A[vecin]);
            }
        }
    }
}

void afisare()
{
    for(int i=2; i<=n; i++)
        if(D[i] == oo)
            D[i] = 0;
    for(int i=2; i<=n; i++)
        g<<D[i]<<" ";
    g<<"\n";
}

int main()
{
    citire();
    Dijkstra();
    afisare();
    return 0;
}