#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,i,j,a[5000][50000],k,m,x,y,z;
int main()
{
    f>>n>>m;
    for (i=1;i<=m;i++)
    {
        f>>x>>y>>z;
        a[x][y]=z;
        a[y][x]=z;
    }

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