#include<iostream>
#include <fstream>
#include<climits>
using namespace std;

int a[22001][22001];
int D[22001], V[22001];
int n, x, y, nr,m,c, p, i, k, min1,ok;
int main ()
{
    ifstream f ("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    for(i=1; i<=m; i++)
        {
            f>>x>>y>>c;
            if (c==0)
                c=INT_MAX;
            a[x][y] = c;
        }

    for (i=1; i<=n; i++)
        D[i] = INT_MAX;
    p=1;
    D[p] = 0;
    ok=1;///pp ca mai avem costuri minime de gasit
    nr=0;
    while (ok==1 &&nr<n)
    {
        min1 = INT_MAX;
        for (i=1; i<=n; i++)
            if (D[i] < min1 && V[i] == 0)
            {
                min1 = D[i];
                k = i;
            }
        nr++;
        V[k] = 1;
        if (min1 == INT_MAX)
            ok=0;

        for (i=1; i<=n; i++)
            if (a[k][i] != 0 && D[i] > D[k] + a[k][i])
                D[i] = D[k] + a[k][i];
    }
    for (i=2; i<=n; i++)
            {g<<D[i]<<" ";

            }
    return 0;
}