#include <bits/stdc++.h>

using namespace std;
vector<pair<int,int>>G[100001];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
#define INF 1000000000
int n,m,d[100001];
int main(){
    fin>>n>>m;
    for(int ll=1;ll<=m;ll++){
        int i,j,cost;
        fin>>i>>j>>cost;
        G[i].push_back({j,cost});
        G[j].push_back({i,cost});
    }
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[1]=0;
    priority_queue<pair<int,int> ,vector<pair<int,int>>,greater<pair<int,int>>>Q;
    Q.push({0,1});
    while(!Q.empty()){
        int x=Q.top().first; /// costul
        int y=Q.top().second; /// nodul
        Q.pop();
        if(x>d[y])
            continue;
        for(size_t i=0;i<G[y].size();i++){
            int vecin=G[y][i].first;
            int cost=G[y][i].second;
            if(d[vecin]>d[y]+cost)
                {d[vecin]=d[y]+cost;
                Q.push({d[vecin],vecin});}
        }
    }
    for(int i=2;i<=n;i++)
        fout<<d[i]<<" ";
    return 0;
}