#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

const long size = 50100;
const long maxi = 2000000000;
long n,m,i,j,u,x,y,t;
long dist[size];

struct nod{
 long csp,ta;
};

vector<nod> v[size];
vector<nod>::iterator q;
nod adat;

struct comp
{
  bool operator() (long a, long b) { return dist[a]<dist[b]; }     
};

int main()
{
 freopen("dijkstra.in","r",stdin);
 freopen("dijkstra.out","w",stdout); 
 
 scanf("%ld %ld\n",&n,&m);
 for(i=1;i<=n;++i){
   for(j=1;j<=m;++j){
     scanf("%ld %ld %ld\n",&x,&y,&t);
     adat.csp=y;
     adat.ta=t;
     v[x].push_back(adat);                
   }                 
   scanf("\n");
 }
 
 priority_queue<long, vector<long>, comp> heap;
 
 for(i=1;i<=n;++i) dist[i]= maxi;
 heap.push(1);
 dist[1]=0;
 
 while(!heap.empty()){
  u=heap.top();
  heap.pop();
  for(q=v[u].begin(); q<v[u].end(); ++q){
   if(dist[q->csp]>dist[u]+q->ta){
     dist[q->csp]=dist[u]+q->ta;
     heap.push(q->csp);                              
   }              
  }
 }
 
 for(i=2;i<=n;++i){
    if(dist[i]==maxi){ printf("0 "); } 
    else
    { printf("%ld ",dist[i]); }
 }   
 
 return 0;
}