#include<bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
queue<int> q;
vector<pair<int,int>> a[100001];
int distanta[1000001], vizitat[1000001];
int main()
{
  int n, start, i, h, d, k, y, m;
  fin>>n>>m;
      int inf=1000000;
    memset(distanta,inf,sizeof(distanta));
    distanta[start]=0;
  for(i=1; i<=m; i++){fin>>d>>h>>y; a[d].push_back(make_pair(h, y));
      a[h].push_back(make_pair(d, y));
  }
    priority_queue<pair<int,int>> q;
    q.push({0,1});
    distanta[1]=0;
    for(i=1;i<=n;i++){
        sort(a[i].begin(),a[i].end());
    }
    while(!q.empty()){
        k=q.top().second;
        q.pop();
        if(vizitat[k]==0){
            vizitat[k]=1; 
            for(auto element:a[k]){
                int i=element.first;
                int weight=element.second;
                if(distanta[i]>distanta[k]+weight){
                    distanta[i]=distanta[k]+weight; 
                    q.push({-distanta[i],i});
                }
            }
        }
    }
     for(int i=2;i<=n;++i) {
            fout<<distanta[i]<<" ";
    }
}