#include <iostream>
#include <fstream>
#include <queue>
#include <vector>;
#define inf 0x3f3f3f3f
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector <pair <int, int> > G[50005];
priority_queue < pair <int, int> > PQ;
int n,m,dist[50005];
void djk(int x)
{
  PQ.push(make_pair(0,x));
  while(!PQ.empty())
  {
      int nod,D;
      nod=PQ.top().second;
      D=-PQ.top().first;
      PQ.pop();
      for( int i=0; i<G[nod].size(); ++i )
      {
          if(dist[G[nod][i].first]> D+G[nod][i].second)
          {
              dist[G[nod][i].first]=D+G[nod][i].second;
              PQ.push(make_pair(-dist[G[nod][i].first],G[nod][i].first));
          }
      }
  }
  for(int i=2; i<=n; ++i) g<<dist[i]<<" ";
}
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        int x,y,z;
        f>>x>>y>>z;
        G[x].push_back(make_pair(y,z));

    }
    for(int i=2;i<=n;++i)
        dist[i]=inf;
        dist[1]=0;
    djk(1);

    return 0;
}