use std::collections::{VecDeque, BinaryHeap};

fn topologycal_sort(paths: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
    let n = paths.len();
    let mut ret = vec![];
    let mut ins = vec![0usize; n];
    for i in 0..n {
        for &(v, _) in paths[i].iter() {
            ins[v] += 1;
        }
    }
    let mut que = BinaryHeap::new();
    for i in 0..n {
        if ins[i] == 0 {
            que.push(i);
        }
    }
    while let Some(x) = que.pop() {
        ret.push(x);
        for &(v, _) in paths[x].iter() {
            ins[v] -= 1;
            if ins[v] == 0 {
                que.push(v);
            }
        }
    }
    ret
}

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();
    let mut m = String::new();
    std::io::stdin().read_line(&mut m).ok();
    let m: usize = m.trim().parse().unwrap();

    let mut paths = vec![vec![]; n];
    for _ in 0..m {
        let mut temp = String::new();
        std::io::stdin().read_line(&mut temp).ok();
        let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let p = temp[0]-1;
        let q = temp[1];
        let r = temp[2]-1;
        paths[r].push((p, q));
    }

    let orders = topologycal_sort(&paths);
    let mut dp = vec![0usize; n];
    dp[n-1] = 1;
    for &u in orders.iter() {
        for &(v, cnt) in paths[u].iter() {
            dp[v] += dp[u] * cnt;
        }
        if paths[u].len() > 0 {
            dp[u] = 0;
        }
    }
    for &v in dp.iter().take(n-1) {
        println!("{}", v);
    }
}