#include<fstream>
using namespace std;
const int INFINIT = 0x3f3f3f3f;
const int NMAX=10000;
int m,n,d[NMAX],C[NMAX][NMAX],viz[NMAX],  tata[NMAX];;
void citire ()
{
	ifstream f("dijkstra.in");
	f>>n>>m;
	int x,y,c,i,j;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
			C[i][j]=INFINIT;
	}
	for(i=1;i<=m;i++)
	{
		f>>x>>y>>c;
		C[x][y]=c;
	}
	f.close();
}
void dijkstra(int x0)
{
    int i, j, minim, k, ok;
    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) {
        minim = INFINIT;
        for (i = 1; i<=n; i++)
            if (!viz[i] && minim>d[i]) {
                minim = d[i];
                k = i;
            }
        if (minim != 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;
    }
}

void scrie()
{
	ofstream g("dijkstra.out");
	int i;
	for(i=2;i<=n;i++)
		g<<d[i]<<' ';
	g.close();
}
int main ()
{
	citire();
	dijkstra(1);
	scrie();
	return 0;
}