#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

vector<P> edge[100];
vector<ll> ans;

void rec(int id, ll num) {
  if(edge[id].size() == 0) ans[id] += num;
  else {
    rep(i, edge[id].size()) {
      rec(edge[id][i].F, num * edge[id][i].S);
    }
  }
}

int main() {
  // ios_base::sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  rep(i, M) {
    int p, q, r;
    cin >> p >> q >> r;
    edge[r - 1].push_back(P(p - 1, q));
  }
  ans = vector<ll>(N, 0);
  rec(N - 1, 1);
  rep(i, N - 1) cout << ans[i] << endl;
  return 0;
}