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

using namespace std;

const int kNmax = 50005;
const int inf = 10000000;

class Task {
 public:
	void solve() {
		read_input();
		print_output(get_result());
	}

 private:
	int n;
	int m;
	vector<pair<int,int> > adj[kNmax];

	void read_input() {
		ifstream fin("dijkstra.in");
		fin >> n >> m;
		for (int i = 1, x, y, c; i <= m; i++) {
			fin >> x >> y >> c;
			adj[x].push_back(make_pair(y, c));
		}
		fin.close();
	}

	vector<int> get_result() {
		priority_queue<pair<int, int>, vector <pair <int,int> > > q;
		vector<int> d(n + 1, inf);

		d[1] = 0;
		q.push(make_pair(0, 1));

		while (!q.empty()) {
			pair<int, int> u = q.top();
			q.pop();

			if (d[u.second] >=  u.first) {
				for (unsigned int i = 0; i < adj[u.second].size(); ++i) {
					int nod = adj[u.second][i].first;
					if (d[nod] > d[u.second] + adj[u.second][i].second) {
						d[nod] = d[u.second] + adj[u.second][i].second;
						q.push(make_pair(d[nod], nod));
					}
				}
			}
		}

		return d;
	}

	void print_output(vector<int> result) {
		ofstream fout("dijkstra.out");
		for (int i = 2; i < int(result.size()); i++) {
			if (result[i] == inf) {
				fout << 0 << ' ';
			}
			else {
				fout << result[i] << ' ';
			}
		}
		fout << '\n';
		fout.close();
	}
};

int main() {
	Task *task = new Task();
	task->solve();
	delete task;
	return 0;
}