#include <bits/stdc++.h>

using namespace std;
ifstream fin ("dmin.in");
ofstream fout ("dmin.out");
const int MOD = 104659;
const int MAX = 1505;
const int INF = 1e9;
const double eps = 1e-6;
set < pair <double,int> > T;
vector < pair <double,int> > G[MAX];
struct fac{
int c,d;
}D[MAX];
inline int mod(double x){
return max(x,-x);
}
inline void solve()
{
    int cost,nod,ok;
    T.insert({0,1});

}
int main()
{
    int n,m,x,y,c;
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y >> c;
        G[x].push_back({log(c),y});
        G[y].push_back({log(c),x});
    }
    for(int i = 2; i <= n; i++)
        D[i].d = INF,D[i].p = INF;
    solve();
    for(int i = 2; i <= n; i++)
        fout << D[i].c << " ";
    return 0;