#include<algorithm>
#include<fstream>
#include<queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
queue <int>A;
vector < pair <int, int> > S[50100];
int n,m,i,j,k,p[50100],a,b,c;

int dijkstra()
{
	for(i=2;i<=m;++i) p[i]=200000000;
	A.push(1);
	for(;!A.empty();A.pop())
	{
		int nod = A.front();
        for (vector < pair <int, int> > :: iterator it = S[nod].begin(); it != S[nod].end(); ++it)
            if (p[it -> first] > p[nod])
            {
                p[it -> first] = p[nod];
                A.push(it -> first);
            }
	}
}





int main()
{
	f>>n>>m;
	for(i=1;i<=m;i++)
	{
		f>>a>>b>>c;
		S[a].push_back(make_pair(b,c));
	}
	
	dijkstra();
	
	for (int i = 2; i <= n; ++i, g << ' ')
        if (p[i] == 2000000000)
            g << "0";
        else
            g << p[i];
	
		
		
		
}