#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

#define NMax 50003
#define inf (1 << 30) - 1

int n, m;
vector< pair<int, int> > G[NMax];
int d[NMax];
bitset<NMax> viz;

class Cmp{
	public:
		bool operator()(int a, int b){
			return d[a] > d[b];
		}
};
priority_queue<int, vector<int>, Cmp> q;

int main(){
	int i, j, x, y, c;
	fin >> n >> m;
	for(i = 1; i <= m; i++){
		fin >> x >> y >> c;
		G[x].push_back(make_pair(y, c));
	}
	for(i = 2; i <= n; i++)
		d[i] = inf;
	
	q.push(1);
	while(!q.empty()){
		x = q.top(); q.pop();
		if(!viz[x]){
			viz[x] = true;
			for(j = 0; j < G[x].size(); j++)
				if(d[G[x][j].first] > d[x] + G[x][j].second){
					d[G[x][j].first] = d[x] + G[x][j].second;
					q.push(G[x][j].first);
				}
		}
	}
	
	for(int i = 2; i <= n; i++)
		fout << (d[i] == inf ? 0 : d[i]) << ' ';
}