#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define VMAX 2000000000
#define MAX 50010
#define x first
#define y second

using namespace std;

int n,m,a,b,c;
int d[MAX];
bool cl[MAX];
vector< pair<int,int> > nd[MAX];
priority_queue< pair<int,int> > q;
pair<int,int> ac;

int main()
{
    ifstream f ("dijkstra.in");
    ofstream g ("dijkstra.out");
    f>>n>>m;
    for(int i=1;i<=m;i++)
      f>>a>>b>>c,
      nd[a].push_back(make_pair(b,c)),
      nd[b].push_back(make_pair(a,c));
    for(int i=2;i<=n;i++) d[i]=VMAX;
    q.push(make_pair(0,1)); //distanta, nodul
    while(not q.empty()){
      ac=q.top(); q.pop();
      if(cl[ac.y])continue;
      cl[ac.y]=1;
      for(auto i:nd[ac.y]) //la i .x=nodul urm, .y=costul
        if(-ac.x+i.y<d[i.x])
          d[i.x]=-ac.x+i.y,
          q.push(make_pair(-d[i.x],i.x));
    }
    for(int i=2;i<=n;i++)
      if(d[i]!=VMAX) g<<d[i]<<" ";
      else g<<"0 ";
    f.close ();
    g.close ();
    return 0;
}
//
//priority_queue<NOD, vector<NOD>, cmp> pq;
//
//struct NOD {
//  unsigned short int n;
//  int d;
//};
//
//
//struct cmp {
//  bool operator()(const NOD& a, const NOD& b) const {
//    return (a.d > b.d); // descrescator
//  }
//};