//#include<cstdio>
#include<fstream>
#include<vector>
#include<queue>
#define inf 0xFFFFFFF
using namespace std;
ifstream f("dijkstra.in"); ofstream g("dijkstra.out");
struct nod { int nod, cost; };
int n, m;
vector <nod> L[50001];
vector <int> dmin;
queue <int> q;
void Dijkstra(int k)
{	int i;
	dmin[k] = 0; q.push(k);
	while(!q.empty()) 
	{	k = q.front(); q.pop();
		for(i = 0; i < (int)L[k].size(); i++)
			if(dmin[L[k][i].nod] > dmin[k] + L[k][i].cost) 
			{	dmin[L[k][i].nod] = dmin[k] + L[k][i].cost;
				q.push(L[k][i].nod);
			}
	}
}
int main()
{	int i, x, y, c;
	//freopen(, "r", stdin), freopen("dijkstra.out", "w", stdout);
	f>>n>>m; //scanf("%d %d", &n, &m);
	for(i = 1; i <= m; i++) 
	{	f>>x>>y>>c; //scanf("%d %d %d", &x, &y, &c);
		L[x].push_back((nod){y, c});
	}
	dmin.assign(n + 1, inf);
	Dijkstra(1);
	for(i = 2; i <= n; i++) g<<(dmin[i] != inf ? dmin[i] : 0)<<' ';//printf("%d ", dmin[i] != inf ? dmin[i] : 0);
	g<<'\n'; return 0;
}