#include <bits/stdc++.h>
#define inf 1e9
using namespace std;
const int nmax=5e4+3;
int n,m,a,b,c,nod,dist[nmax];
vector < pair <int,int> > v[nmax];
priority_queue < pair <int,int> > q;
int main()
{
freopen("dijkstra.in","r",stdin);
freopen("dijkstra.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=m;++i)
{
scanf("%d%d%d",&a,&b,&c);
v[a].push_back({c,b});
}
q.push({0,1});
for(int i=2;i<=n;++i) dist[i]=inf;
while(!q.empty())
{
nod=q.top().second;
q.pop();
for(int i=0;i<v[nod].size();++i)
{
if(dist[v[nod][i].second]>dist[nod]+v[nod][i].first)
{
dist[v[nod][i].second]=dist[nod]+v[nod][i].first;
q.push({-dist[v[nod][i].second],v[nod][i].second});
}
}
}
for(int i=2;i<=n;++i)
{
if(dist[i]==inf) printf("0 ");
else printf("%d ",dist[i]);
}
return 0;
}