#include <bits/stdc++.h>
#define DIM 50010
#define inf 2000000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,i,x,y,c,vecin,cost,nod,d[DIM];
vector< pair<int,int> > L[DIM];
set< pair<int,int> > s;
int main() {
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y>>c;
        L[x].push_back({y,c});
        L[y].push_back({x,c});
    }
    for (i=2;i<=n;i++)
        d[i]=inf;
    s.insert({0,1});
    while (!s.empty()) {
        nod=s.begin()->second;
        s.erase(s.begin());
        for (auto it:L[nod]) {
            vecin=it.first;
            cost=it.second;
            if (d[vecin]>d[nod]+cost) {
                s.erase({d[vecin],vecin});
                d[vecin]=d[nod]+cost;
                s.insert({d[vecin],vecin});
            }
        }
    }
    for (i=2;i<=n;i++) {
        if (d[i]==inf)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}