#include <bits/stdc++.h>
#define MAXN 50000
#define INF 0x3f3f3f3f
using namespace std;
long long dist[MAXN], vis[MAXN];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
priority_queue< pair<long long, long long> > pq;//1-distanta, 2-nodul
vector<pair<int, int>> g[MAXN];//graful
void dijkstra(int node){
    memset(dist, INF, sizeof(dist));
    dist[node]=0;//trebuie sa plec, after all
    pq.push(make_pair(0, node));
    while(!pq.empty()){//cata vreme nu am cerecetat totul
        node=pq.top().second;
        pq.pop();//
        if(vis[node]==0){//daca nodul n-a fost vazut
            vis[node]=1;
            for(int i=0; i<g[node].size(); i++){
                if(dist[node]+g[node][i].second<dist[g[node][i].first]){//daca e mai eficient asa
                    dist[g[node][i].first]=dist[node]+g[node][i].second;//modificarile de rigoare
                    pq.push(make_pair(-dist[g[node][i].first], g[node][i].first));
                }
            }
        }
    }
}
int main(){
    int n, m; fin>>n>>m;;
    for(int i=0; i<m; i++){
        int x, y, c; fin>>x>>y>>c;
        g[x].push_back(make_pair(y, c));
        g[y].push_back(make_pair(x, c));
    }
    dijkstra(1);
    for(int i=2; i<=n; i++){
        fout<<dist[i]<<" ";
    }
    return 0;
}