//#include "pch.h"
#include <fstream>
#include <iostream>
#include <climits>
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
void printSolution(int dist[], int N)
{
	for (int i = 1; i < N; i++)
		fout<< dist[i] << ' ';
}

int minDistance(int dist[], bool visited[], int N) {
	int min = INT_MAX, min_index;

	for (int i = 0; i < N; i++) {
		if (visited[i] == false && dist[i] <= min)
			min = dist[i], min_index = i;
	}

	return min_index;
}
void dijkstra(int **graph, int start, int N) {
	int dist[50001];
	bool visited[50001];

	for (int i = 0; i < N; i++)
		dist[i] = INT_MAX, visited[i] = false;
		
	dist[start] = 0;

	for (int count = 0; count < N-1; count++) {
		int u = minDistance(dist, visited, N);
		visited[u] = true;
		for (int i = 0; i < N; i++)
			if (visited[i] == false && graph[u][i] && dist[u] != INT_MAX && dist[u] + graph[u][i] < dist[i])
				dist[i] = dist[u] + graph[u][i];
	}
	printSolution(dist, N);
}


int main()
{
	int N=0, M=0;
	fin >> N >> M;
	int **graph;
	graph = new int*[N];
	for (int i = 0; i < N; i++)
		graph[i] = new int[N];
	for (int i = 0; i < N; i++)
		for (int j = 0; j < N; j++)
			graph[i][j] = 0;
	for (int it = 0; it < M; it++){
		int i, j, c;
		fin >> i >> j >> c;
		graph[i][j] = c;
		graph[j][i] = c;
	}
	dijkstra(graph, 0, N);
	
	return 0;
}