//*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
 
#include <bits/stdc++.h>
 
// #include <atcoder/all>
 
using namespace std;
// using namespace atcoder;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
// #define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
void YES(bool t=true) {cout<<(t?"YES":"NO")<<endl;}
void Yes(bool t=true) {cout<<(t?"Yes":"No")<<endl;}
void yes(bool t=true) {cout<<(t?"yes":"no")<<endl;}
void NO(bool t=true) {cout<<(t?"NO":"YES")<<endl;}
void No(bool t=true) {cout<<(t?"No":"Yes")<<endl;}
void no(bool t=true) {cout<<(t?"no":"yes")<<endl;}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
    }
} setup_io;
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int N = 1011;
vector<vector<pll>> G(N);


vi bfs(vector<vector<pll>>& G, int start, int n) {
    vl dist(n, INF);
    dist[start] = 0;
    queue<int> qu;
    qu.push(start);
    vi jun;
    while (qu.size()) {
        int u = qu.front();
        qu.pop();
        jun.push_back(u);
        for (pii vv: G[u]) {
            int v = vv.first;
            ll ncost = dist[u] + 1;
            if (dist[v] > ncost) {
                dist[v] = ncost;
                qu.push(v);
            }
        }
    }
    return jun;
}

signed main() {
    int n, m;
    cin >> n >> m;
    vl ww;
    rep (i, m) {
        int u, v, w;
        cin >> u >> v >> w;
        u--; v--;
        G[u].push_back(pll(v, w));
        ww.push_back(w);
    }
    sort(all(ww));
    UNIQUE(ww);

    vi jun = bfs(G, 0, n);
    // DEBUG_VEC(jun);

    vl ans(n, inf);
    vl num(n, -n - 10);
    num[0] = 0;
    int ok = n + 10;
    for (ll x: ww) {
        stack<pii> st;
        rrep (i, jun.size()) {
            int u = jun[i];
            if (num[u] == -n - 10) continue;
            st.push(pll(u, num[u]));
        }

        while (st.size()) {
            auto [u, cost] = st.top();
            st.pop();
            if (num[u] > cost) continue;

            for (pll temp: G[u]) {
                int v = temp.first;
                int ncost = cost;
                if (ncost < ok) {
                    if (temp.second <= x) ncost++;
                    else ncost--;
                }

                if (num[v] < ncost) {
                    num[v] = ncost;
                    st.push(pll(v, ncost));
                }
            }
        }

        rep (i, n) {
            if (ans[i] == inf and num[i] >= 0) {
                ans[i] = x;
            }
        }
    }
    rep1 (i, n - 1) {
        if (ans[i] == inf) ans[i] = -1;
        cout << ans[i] << endl;
    }
}