#include <fstream>
using namespace std;

const int inf=2000000000;
int a[1000][1000], d[1000], p[1000], c[1000];

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

int main()
{
    int n, m, i, j, x, y, cost, sur, nod, mini, poz;
    f>>n>>m;
    for (i=1; i<=m; ++i) {
        f>>x>>y>>cost;
        a[x][y]=cost;
    }
    sur=1;
    for (i=1; i<=n; ++i) {
        d[i]=inf;
        c[i]=i;
    }
    d[sur]=0;
    c[0]=n;
    for (i=1; i<=n; ++i) {
        mini=inf;
        for (j=1; j<=c[0]; ++j)
            if (d[c[j]]<mini) {
                mini=d[c[j]];
                poz=j;
            }
        nod=c[poz];
        for (j=poz; j<=c[0]; ++j)
            c[j]=c[j+1];
        --c[0];
        for (j=1; j<=c[0]; ++j)
            if (a[nod][c[j]] && a[nod][c[j]]+d[nod]<d[c[j]]) {
                d[c[j]]=a[nod][c[j]]+d[nod];
                p[c[j]]=nod;
            }
    }
    for (i=2; i<=n; ++i)
        g<<(d[i]!=inf)*d[i]<<' ';
    return 0;
}