#include<cstdio>
#include<set>
#include<vector>
using namespace std;
#define P push_back
#define F first
#define S second
const int N=50001,I=1<<30;
set<pair<int,int>> c;
int n,m,d[N],i,j,k;
vector<pair<int,int>> a[N];
int main()
{
	freopen("dijkstra.in","r",stdin),freopen("dijkstra.out","w",stdout),scanf("%d%d",&n,&m);
	while(m--)
	  	scanf("%d%d%d",&i,&j,&k),a[i].P({j,k});
    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)
        printf("%d ",d[i]==I?0:d[i]);
    return 0;
}