#define MAX_N 50000
#define INF 0x3f3f3f3f

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

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

using PII = pair<int, int>;

int n, m, D[MAX_N + 1];
vector<PII> G[MAX_N + 1];

void Dijkstra();

int main()
{
	fin >> n >> m;
	
	for (int i = 0, x, y, c; i < m; ++i)
	{
		fin >> x >> y >> c;
		G[x].emplace_back(c, y);
	}
	
	Dijkstra();
	
	for (int i = 2; i <= n; ++i)
	{
		if (D[i] == INF)
		{
			fout << "0 ";
		}
		else
		{
			fout << D[i] << ' ';
		}
	}
	
	fin.close();
	fout.close();
	return 0;
}

bitset<MAX_N + 1> inQ;
void Dijkstra()
{
	for (int i = 2; i <= n; ++i)
	{
		D[i] = INF;
	}
	
	priority_queue<PII, vector<PII>, greater<PII>> Q;
	Q.emplace(0, 1);
	
	while (!Q.empty())
	{
		PII T = Q.top();
		Q.pop();
		inQ[T.second] = false;
		
		for (const PII& vecin : G[T.second])
		{
			if (D[vecin.second] > (D[T.second] + vecin.first))
			{
				D[vecin.second] = D[T.second] + vecin.first;
				
				if (!inQ[vecin.second])
				{
					Q.emplace(D[vecin.second], vecin.second);
					inQ[vecin.second] = true;
				}
			}
		}
	}
}