#include <iostream>
#include <fstream>
#define NMAX 1001
#define INFINIT 30000
using namespace std;

int n,m,i,j,k,C[1001][1001],d[NMAX];

void dijkstra(int x0)
{
    int i, j, min, k, ok;
    int viz[NMAX], tata[NMAX];
    for (i = 1; i<=n; i++) {
        d[i] = C[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]) {
                min = d[i];
                k = i;
            }
        if (min != INFINIT) {
            viz[k] = 1;
            for (i = 1; i<=n; i++)
               if (!viz[i] && d[i]>d[k]+C[k][i]) {
                   d[i] = d[k]+C[k][i];
                   tata[i] = k;
               }
        }
        else ok = 0;
    }
}

int main ()
{
	ifstream f("dijkstra.in");
	ofstream g("dijkstra.out");
	
	f>>n>>m;
	for (i=1; i<=n; i++)
		for (j=1; j<=n; j++)
			if (i==j) C[i][j]=0;
			else C[i][j]=INFINIT;
			
	for (i=1; i<=m; i++)
	{
		f>>j>>k;
		f>>C[j][k];
	}
	
	dijkstra(1);
	
	for (i=2; i<=n; i++) g<<d[i]<<" ";
	f.close(); g.close();
	return 0;
}