#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
vector<int> toposort(const int n,const vector<pair<int,int>>& edges){
    queue<int> que;
    vector<int> indegree(n);
    vector<vector<int>> adj(n);
    for(auto& [u,v]: edges){
        ++indegree[v];
        adj[u].emplace_back(v);
    }
    for(int i=0;i<n;++i)if(!indegree[i]){
        que.emplace(i);
    }
    vector<int> ret;
    while(!que.empty()){
        const int u=que.front(); que.pop();
        ret.emplace_back(u);
        for(int&v:adj[u])if(!--indegree[v])que.emplace(v);
    }
    return ret;
}
void solve(){
    int N,M;cin>>N>>M;
    vector<pair<int,int>> edges;
    vector<vector<pair<int,int>>> material(N);
    for(int i=0;i<M;++i){
        int u,c,v;cin>>u>>c>>v;
        --u,--v;
        edges.emplace_back(u,v);
        material[v].emplace_back(u,c);
    }

    auto order=toposort(N,edges);
    ranges::reverse(order);
    vector<ll> ans(N);
    ans.at(N-1)=1;
    for(auto&u:order){
        for(auto&[v,cost]:material[u]){
            ans[v]+=ans[u]*cost;
        }
        if(!material[u].empty())ans[u]=0;
    }
    ans.erase(prev(ans.end()));
    for(auto&c:ans)cout<<c<<'\n';
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T=1; // cin>>T;
    while(T--)solve();
    return 0;
}