#include<cstdio>
#include<vector>
#define INFINIT 500000
#define NMAX 50000
using namespace std;
int i,k,x,y,n,m,mini,j;
int a[1000][1000];
int d[50000],tata[50000],viz[50000];
void dijkstra(int x0)
{
    int i, min, k, ok;
    int viz[NMAX], d[NMAX], tata[NMAX];
    for (i = 1; i<=n; i++) {
        d[i] = a[x0][i];
        tata[i] = x0;
        viz[i] = 0;
    }
    tata[x0] = 0;
    viz[x0] = 1; ok = 1;
    while (ok) {
        min = INFINIT;
        for (i = 1; i<=n; i++)
            if (!viz[i] && min>d[i]&&d[i]!=0) {
                min = d[i];
                k = i;
            }
        if (min != INFINIT) {
            viz[k] = 1;
            for (i = 1; i<=n; i++)
               if (!viz[i] && d[i]>d[k]+a[k][i]) {
                   d[i] = d[k]+a[k][i];
                   tata[i] = k;
               }
        }
        else ok = 0;
    }
	for(i=2;i<=n;i++)
		printf("%d ",d[i]);
	
}
	
	

int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
	for(j=1;j<=m;j++)
		a[i][j]=INFINIT;
	for(i=1;i<=m;i++)
	{
		scanf("%d %d %d",&x,&y,&k);
	a[x][y]=k;
	a[y][x]=k;
	}
	dijkstra(1);
	
	return 0;}