#include <bits/stdc++.h>
#define inf INT_MAX
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
int n,m,i,j,x,y,c;
int d[50005],viz[50005];
vector<pair< int,int> >v[50005];
priority_queue< pair<int,int>, vector< pair<int,int> >, greater<pair<int,int> > >q;
void dijkstra(int x)
{
    int nod,dist;
   q.push({x,0});
   d[x]=1;
   while(!q.empty())
   {
       nod=q.top().first;
       dist=q.top().second;
       if(viz[nod]==0)
       {
       for(i=0;i<v[nod].size();i++)
       {
           if(dist+v[nod][i].second<d[v[nod][i].first])
           {
               d[v[nod][i].first]=dist+v[nod][i].second;
               q.push({v[nod][i].first,d[v[nod][i].first]});
           }
       }

       }
       viz[nod]=1;
       q.pop();
   }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x>>y>>c;
        v[x].push_back({y,c});
        d[i]=inf;
    }
    dijkstra(1);
     for(i=2;i<=n;i++) {if(d[i]==inf) d[i]=0;g<<d[i]<<" ";}
    return 0;
}