#include <iostream>
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
vector <pair <int,int> > v[50001];
int x,y,z,n,m;
int d[50001];
int use[50001];
priority_queue <pair <int , int>, vector<pair <int, int> >, greater <pair<int ,int > > > h;
int main()
{
   int i;
   freopen("dijkstra.in","r",stdin);
   freopen("dijkstra.out","w",stdout);
scanf("%d%d",&n,&m);
   for(i=1;i<=m;i++)
   {scanf("%d%d%d",&x,&y,&z);
   v[x].push_back(make_pair(z,y));

   }
   for(i=1;i<=n;i++) d[i]=1e9;
   d[1]=0;
   h.push(make_pair(0,1));
   while(!h.empty()){
    int nod=h.top().second;
    h.pop();
    if(!use[nod]){
        for(i=0;i<v[nod].size();i++)
        if(d[nod]+v[nod][i].first<d[v[nod][i].second])
     {

     d[v[nod][i].second]=d[nod]+v[nod][i].first;
     h.push(make_pair(d[v[nod][i].second],v[nod][i].second));


    }
    use[nod]=1;
   }
   }
   for(i=2;i<=n;i++) if(d[i]==1e9) printf("0 ");
   else printf("%d ",d[i]);
    return 0;
}