#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> toposort(const int n,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(auto& v: adj[u]){
      --indegree[v];
      if(indegree[v]==0) que.emplace(v);
    }
  }
  return ret;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N; cin>>N;
    int M; cin>>M;
    vector<pair<int, int>> edges;
    vector<vector<pair<int, int>>> material(N);
    for(int i=0;i<M;++i){
      int p,q,r; cin>>p>>q>>r;
      --p,--r;
      edges.emplace_back(p, r);
      material[r].emplace_back(p, q);
    }

    auto order = toposort(N, edges);
    reverse(order.begin(), order.end());
    vector<int> ans(N);
    ans.at(N-1)=1;
    for(auto&u: order){
      for(const auto& [v, cost]: material[u]){
        ans[v]+=ans[u]*cost;
      }
      if(!material[u].empty()) ans[u]=0;
    }
    for(int i=0;i+1<N;++i){
      cout<<ans[i]<<'\n';
    }
    return 0;
}