#include <iostream>
#include <fstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>

using namespace std;

const int INF = 0x3f3f3f3f;

int cntNodes, cntEdges;
map<int, vector<pair<int, int>>> graph;
vector<int> dist;
vector<int> parent;

void read(const string& inputFilePath) {
	ifstream fin(inputFilePath);

	fin >> cntNodes >> cntEdges;
	for (int i = 0; i < cntEdges; ++i) {
		int node1, node2, weight;
		fin >> node1 >> node2 >> weight;
		graph[node1].push_back(make_pair(weight, node2));
		graph[node2].push_back(make_pair(weight, node1));

	}

	fin.close();
}

void dijkstra() {
	for (int i = 0; i <= cntNodes; ++i) {
		dist.push_back(INF);
		parent.push_back(0);
	}

	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> minHeap;
	minHeap.push(make_pair(0, 1));
	dist[1] = 0;
	while (!minHeap.empty()) {
		int currentNode = minHeap.top().second;
		int d = minHeap.top().first;
		minHeap.pop();

		for (const auto& edge : graph[currentNode])
			if (dist[edge.second] > edge.first + d) {
				dist[edge.second] = edge.first + d;
				parent[edge.second] = currentNode;
				minHeap.push(make_pair(dist[edge.second], edge.second));
			}
	}
}

void print() {
	ofstream fout("dijkstra.out");
	for (int i = 2; i <= cntNodes; ++i)
		fout << (dist[i] != INF ? dist[i] : 0) << " ";
	fout << "\n";
}

int main() {
	read("dijkstra.in");
	dijkstra();
	print();
	return 0;
}