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


using namespace std;

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

const int NMAX = 5e4;
const int INF = 1e9;

vector <pair<int, int>> adj[NMAX + 1];
priority_queue <pair<int, int>, vector <pair<int, int>>, greater <pair<int, int>>> pq;
bool viz[NMAX + 1];
int dist[NMAX + 1];

int n, m;

void djk(int s){
	for(int i = 1; i <= n; i++)
		dist[i] = INF;
	dist[s] = 0;
	pq.push({dist[s], s});
	while(!pq.empty()){
		int nod = pq.top().second;
		pq.pop();
		if(!viz[nod]){
			for(auto vec : adj[nod])
				if(dist[vec.first] > dist[nod] + vec.second){
					dist[vec.first] = dist[nod] + vec.second;
					pq.push({dist[vec.first], vec.first});
				}

			viz[nod] = true;
		}
	}
}
int main(){
	in >> n >> m;
	for(int i = 1; i <= m; i++){
		int a, b, c;
		in >> a >> b >> c;
		adj[a].push_back({b, c});
	}
	djk(1);
	for(int i = 2; i <= n; i++){
		if(dist[i] == INF)
			out << 0 << ' ';
		else
			out << dist[i] << ' ';
	}
	out << '\n';
	return 0;
}