#include<cstdio>
#include<cmath>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<vector>
#include<deque>
#include<algorithm>
using namespace std;
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define ll long long
const int INF = 1000000000;
const int maxn = 51000;
vector <int> G[maxn] , C[maxn];
int i , j , k , n , m , d[maxn] , a, b , c;
bool in[maxn];

struct cmp {
	bool operator () ( const int &a, const int &b ) {
		return d[a] > d[b];
	}
};

priority_queue <int , vector<int> , cmp > Q;


void Dijkstra()
{
	int i;
	d[1] = 0;
	for ( i = 2 ; i <= n ; ++i ) 
		d[i] = INF;
	Q.push(1);
	in[1] = true;
	
	for( ; !Q.empty(); ) {
		int act = Q.top();
		Q.pop();
		in[act] = false;
		for( i = 0 ; i < G[act].size() ; ++i ) 
			if ( d[G[act][i]] > d[act] + C[act][i] ) {
				d[G[act][i]] = d[act] + C[act][i];
				//if ( !in[G[act][i]] ) {
					Q.push(G[act][i]);
					in[G[act][i]] = true;
				//}
			}
	}
}
		
int main()
{
	freopen("dijkstra.in","r",stdin);
	freopen("dijkstra.out","w",stdout);
	
	scanf("%d %d",&n,&m);
	for( i = 1 ; i <= m ; ++i ) {
		scanf("%d %d %d",&a,&b,&c);
		G[a].push_back(b);
		C[a].push_back(c);
	}
	
	Dijkstra();
	for( i = 2 ; i <= n ; ++i ) 
		printf("%d ",d[i]);
	
return 0;
}