#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
#define max_size 200005
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int dist[50005];
int viz[50005];
vector <int>graph[50005];
vector <int>graphc[50005];
 
int main()
{
    int n,m,x,y,c,i,j,k;
    fin>>n>>m;
    for(i=0;i<m;i++)
    {
        fin>>x>>y>>c;
        graph[x].push_back(y);
        graphc[x].push_back(c);
 
    }
    for(i=1;i<=n;i++)
     dist[i]=max_size;
     dist[1]=0;
    for(i=0;i<n;i++)
     {
         int min=max_size;
         int index=-1;
         for(j=1;j<=n;j++)
         {
             if((!viz[j])&&(dist[j]<min))
             {
                 min=dist[j];
                 index=j;
 
             }
         }
         viz[index]=1;
         int lim=graph[index].size();
         for(k=0;k<lim;k++)
         {
             int vecin=graph[index][k];
             if(dist[vecin]>(dist[index]+graphc[index][k]))
                dist[vecin]=dist[index]+graphc[index][k];
 
         }
 
     }
     for(i=2;i<=n;i++)
     {
         if(dist[i]==max_size)
            dist[i]=0;
            fout<<dist[i]<<" ";
     }
 
    return 0;
}