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

using namespace std;

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

int N, M;
vector<pair<int,int>> G[Nmax];
bool used[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;
   int Min, iMin;
   bool finished;
   do
   {
      Min = INF;
      finished = true;
      for(int i = 1; i <= N; i ++)
      {
         if(!used[i])
         {
            if(D[i] <= Min)
            {
               iMin = i;
               Min = D[i];
            }
            finished = false;
         }
      }
      used[iMin] = true;
      for(int i = 0; i < G[iMin].size(); i ++)
      {
         int Ngh = G[iMin][i].first;
         D[Ngh] = min(D[iMin]+G[iMin][i].second,D[Ngh]);
      }

   }while(!finished);
}

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;
}