#define MAX_N 50000
#define INF 0x3f3f3f3f

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

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

struct V
{
	V(int _n, int _c) : n { _n }, c { _c }
	{
	}
	
	int n, c;
};

int n, m, D[MAX_N + 1];
vector<V> G[MAX_N + 1];
bitset<MAX_N + 1> F;

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(y, c);
		G[y].emplace_back(x, c);
	}
	
	Dijkstra();
	
	for (int i = 2; i <= n; ++i)
	{
		fout << D[i] << ' ';
	}
	
	fin.close();
	fout.close();
	return 0;
}

void Dijkstra()
{
	for (int i = 2; i <= n; ++i)
	{
		D[i] = INF;
	}
	
	priority_queue<int, vector<int>, greater<int>> Q;
	
	for (const auto& vecin : G[1])
	{
		D[vecin.n] = vecin.c;
		Q.push(vecin.n);
	}
	
	while (!Q.empty())
	{
		int T = Q.top();
		Q.pop();
		if (F[T]) { continue; }
		F[T] = true;
		
		for (const auto& vecin : G[T])
		{
			if (D[vecin.n] > (D[T] + vecin.c))
			{
				D[vecin.n] = D[T] + vecin.c;
				Q.push(vecin.n);
			}
		}
	}
}