#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, M;
    cin >> N >> M;
    using edge = pair<int, ll>;
    vector<vector<edge>> g(N);
    vector<int> indeg(N);
    for(int i = 0; i < M; ++i){
        int P, Q, R;
        cin >> P >> Q >> R;
        --P, --R;
        g[R].emplace_back(P, Q);
        indeg[P] += 1;
    }

    vector<ll> dp(N);
    dp[N - 1] = 1;
    queue<int> que;
    for(int i = 0; i < N; ++i){
        if(indeg[i] == 0)   que.emplace(i);
    }
    while(!que.empty()){
        int from = que.front();
        que.pop();
        for(auto [to, cost] : g[from]){
            dp[to] += dp[from] * cost;
            if(--indeg[to] == 0)    que.emplace(to);
        }
    }

    for(int i = 0; i < N - 1; ++i){
        cout << (g[i].size() ? 0 : dp[i]) << '\n';
    }

    return 0;
}