#include <fstream>
#include <vector>
#include <set>
using namespace std;
#define inf 1000000000
int n,m;
const int NMAX=5e4+5;
int d[NMAX];
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int>>G[NMAX];
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});
    }
    int start=1;
    multiset<pair<int,int>>s;
    s.insert(make_pair(0,1));
    for(int i=2;i<=n;i++)
        d[i]=inf;
    while(!s.empty()){
        int p=s.begin()->second;
        s.erase(s.begin());
        for(size_t i=0;i<G[p].size();i++){
            int vecin=G[p][i].first;
            int cost=G[p][i].second;
            if(d[vecin]>cost+d[p]){
                s.erase(make_pair(d[vecin],vecin));
                d[vecin]=cost+d[p];
                s.insert(make_pair(d[vecin],vecin));
            }
        }
    }
    for(int i=2;i<=n;i++)
        if(d[i]!=inf)
        fout<<d[i]<<" ";
        else
            fout<<0<<" ";
    return 0;
}