#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int Nmax = 100005;
const int INF = 2000000000;

int N, M;
vector<pair<int,int>> G[Nmax];
int D[Nmax];

void read()
{
   ifstream f("dijkstra.in");
   f >> N >> M;
   for(int i = 0; i < M; i ++)
   {
      int x, y, z;
      f >> x >> y >> z;
      G[x].push_back(make_pair(y,z));
   }
   f.close();
}

void dijkstra()
{
   for(int i = 1; i <= N; i++)
   {
      D[i] = INF;
   }
   D[1] = 0;
   queue<int> Q;
   Q.push(1);
   while(!Q.empty())
   {
      int Node = Q.front();
      Q.pop();
      for(int i = 0; i < G[Node].size(); i ++)
      {
         int Ngh = G[Node][i].first;
         D[Ngh] = min(D[Ngh],D[Node] + G[Node][i].second);
         Q.push(Ngh);
      }
   }
}

void print()
{
   ofstream g("dijkstra.out");
   for(int i = 2; i <= N; i ++)
   {
      if(D[i] == INF)
      {
         g << 0 << " ";
      }
      else
      {
         g << D[i] << " ";
      }
   }
}

int main()
{
    read();
    dijkstra();
    print();
    return 0;
}