#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

#define PB push_back
#define MKP make_pair
#define maxN 50005
#define INF 0x3f3f3f3f

vector < pair <int , int> > lista[maxN];

int cost[maxN] , N , M;
bool viz[maxN];

int scot_min ()
{
	int nod , costmin = INF;
	
	for (int i = 1 ; i <= N ; ++i)
	{
		if (viz[i]) continue;
		
		if (cost[i] < costmin)
		{
			costmin = cost[i];
			nod = i;
		}
	}
	
	viz[nod] = true;
	
	return nod;
}



int main ()
{
	freopen ("dijkstra.in" , "r" , stdin);
	freopen ("dijkstra.out" , "w" , stdout);
	
	scanf ("%d %d" , &N , &M);
	
	int a , b , c;
	
	for (int i = 1 ; i <= M ; ++i)
	{
		scanf ("%d %d %d" , &a , &b , &c);
		
		lista[a]. PB (MKP (b , c));
	}
	
	for (int i = 1 ; i <= N ; ++i)
		cost[i] = INF;
	
	cost[1] = 0;
	
	int nod , nodcur , costmuc;
	
	for (int t = 1 ; t <= N ; ++t)
	{
		nod = scot_min ();
		
		for (unsigned i = 0 ; i < lista[nod]. size () ; ++i)
		{
			nodcur = lista[nod][i].first;
			costmuc = lista[nod][i].second;
			
			if (viz[nodcur])
				continue;
			
			if (cost[nod] + costmuc < cost[nodcur])
				cost[nodcur] = cost[nod] + costmuc;
		}
	}
	
	for (int i = 2 ; i <= N ; ++i)
	{
		if (cost[i] == INF)
		{
			printf ("0 ");
			continue;
		}
		
		printf ("%d " , cost[i]);
	}
	
	return 0;
}