/*
    Keep It Simple!
*/
  
#include<stdio.h>
#include<list>
  
using namespace std;
  
int n,m;
long long L[50001];
bool viz[50001];
  
list< pair<int,int> > G[50001];
  
int min()
{
    int x = 0;
    for(int i=2;i<=n;i++)
        if(!viz[i])
         if(L[i] < L[x]) x = i;
    return x==0 ? 1:x;
}
  
void Dijkstra()
{
    int i=1;
    L[1] = 0;
        while(!viz[i])
        {
            for(list< pair<int,int> >::iterator it = G[i].begin(); it!=G[i].end(); it++)
                if(!viz[it->first])
                 if(L[it->first] > ( L[i] + it->second) )
                     L[it->first] = L[i] + it->second;
            viz[i] = 1;
            i = min();
        }
}
  
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
      
    scanf("%d %d",&n,&m);
    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&x,&y,&c);
        G[x].push_back( make_pair(y,c) );
    }
    for(int i=0;i<=n;i++) L[i] = 2000000000;
    Dijkstra();
	for(int i=0;i<=n;i++) if ( L[i] == 2000000000 ) L[i] = 0;
    for(int i=2;i<=n;i++)
        printf("%lld ",L[i]);
}