#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

const int oo = 20001;
int n, m, d[50001];
bool f[50001];
priority_queue<int, vector<int>, greater<int>> q;
struct elem {int id, cost;};
vector<elem> g[50001];

void read()
{
	in >> n >> m;
	int x, y, c;
	for(int i = 0; i < m; ++i)
		in >> x >> y >> c,
		g[x].push_back({y, c});
}

void dijkstra()
{
	for(int i = 2; i <= n; ++i)
		d[i] = oo;

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

	int x;
	while(!q.empty())
	{
		x = q.top();
		f[x] = 0;
		q.pop();
		for(auto i : g[x])
			if(d[x] + i.cost < d[i.id])
			{
				d[i.id] = d[x] + i.cost;
				if(f[i.id] == 0)
					q.push(i.id),
					f[i.id] = 1;
			}
	}
}

void afis()
{
	for(int i = 2; i <= n; ++i)
		out << (d[i] != oo ? d[i] : 0) << ' ';
}

int main()
{
	read();
	dijkstra();
	afis();
	return 0;
}