// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1, i64); m],
    }
    let mut e = e;
    e.sort_by_key(|e| e.2);
    let mut g = vec![vec![]; n];
    for &(a, b, _) in e.iter() {
        g[a].push((b, 1));
    }
    g.iter_mut().for_each(|g| g.sort());
    let inf = 100;
    let mut dp = vec![inf; n];
    dp[0] = 0;
    let mut q = std::collections::VecDeque::new();
    q.push_back(0);
    while let Some(v) = q.pop_front() {
        let d = dp[v] + 1;
        for &(u, _) in g[v].iter() {
            if dp[u] > d {
                dp[u] = d;
                q.push_back(u);
            }
        }
    }
    let mut ans = vec![inf; n];
    for &(s, t, w) in e.iter() {
        if dp[s] == inf {
            continue;
        }
        let x = g[s].binary_search(&(t, 1)).unwrap();
        g[s][x].1 = -1;
        let mut update = vec![false; n];
        let mut minus = vec![false; n];
        let mut q = std::collections::VecDeque::new();
        q.push_back(s);
        while let Some(v) = q.pop_front() {
            let d = dp[v];
            for &(u, w) in g[v].iter() {
                let d = d + w;
                if d <= dp[u] {
                    if update[u] {
                        minus[u] = true;
                    } else {
                        dp[u] = d;
                        update[u] = true;
                        q.push_back(u);
                    }
                }
            }
        }
        for i in 0..n {
            if minus[i] {
                q.push_back(i);
            }
        }
        while let Some(v) = q.pop_front() {
            for &(u, _) in g[v].iter() {
                if !minus[u] {
                    minus[u] = true;
                    q.push_back(u);
                }
            }
        }
        for i in 0..n {
            if minus[i] || dp[i] <= 0 {
                ans[i] = ans[i].min(w);
            }
        }
    }
    for a in ans[1..].iter() {
        if *a == inf {
            println!("-1");
        } else {
            println!("{}", *a);
        }
    }
}

fn main() {
    run();
}