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

#define makeP make_pair

using namespace std;

vector<vector<int>> graph;
map<pair<int, int>, int> cost;
map<int, int> costM;

vector<bool> vizitat;


int n, m;

int main()
{
  ifstream diji("dijkstra.in");
  ofstream dijo("dijkstra.out");
   
  diji >> n >> m;
  graph.resize(n);
  vizitat.resize(n);
  
  for (int i = 0; i < m; i++)
    {
      int x, y, c;
      diji >> x >> y >> c;
      
      x--;
      y--;

      graph[x].push_back(y);
      graph[y].push_back(x);
      cost[makeP(x, y)] = cost[makeP(y, x)] = c;
      
    }
  
  costM[0] = 0;

  for (int i = 1; i < n; i++)
    costM[i] = -1;

  
  for (int elem = 0; elem < n-1; elem++)
    {
      vizitat[elem] = 1;

      for (int i = 0; i < graph[elem].size(); i++)
	if(!vizitat[graph[elem][i]] && (costM[graph[elem][i]] == -1 || costM[elem] + cost[makeP(elem, graph[elem][i])] < costM[graph[elem][i]]))
	   costM[graph[elem][i]] = costM[elem] + cost[makeP(elem, graph[elem][i])];
      
    }

  for (int i = 1; i < n; i++)
    dijo << costM[i] << " ";

  
  return 0;
}