#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define I 999999999
#define F first
#define S second
set<pair<int,int>> c;
int n,m,d[100000],x,y,z,b,i,j,k;
vector<pair<int,int>> a[100000];
int main()
{
	ifstream f("dijkstra.in");
	ofstream g("dijkstra.out");
	f>>n>>m;
	while(m--)
	  	f>>x>>y>>z,a[x].pb({y,z});
    for(i=2;i<=n;i++)
        d[i]=I;
	for(c.insert({0,1});!c.empty();)
		for(i=c.begin()->S,c.erase(c.begin()),k=a[i].size(),j=0;j<k;j++)
            if(d[i]+a[i][j].S<d[a[i][j].F])
            {
                if(d[a[i][j].F]!=I)
                    c.erase(c.find({d[a[i][j].F],a[i][j].F}));
                d[a[i][j].F]=d[i]+a[i][j].S,c.insert({d[a[i][j].F],a[i][j].F});
            }
	for(i=2;i<=n;i++)
        g<<(d[i]==I?0:d[i])<<" ";
}