//#include <bits/stdc++.h>
#include <assert.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>
using namespace std;

typedef signed long long ll;

#define pp(...) (void)printf(__VA_ARGS__)
#define For(x,to) for(x=0;x<(to);x++)
#define ForAuto(x,arr) for(auto& x:arr)
#define ForBeginEnd(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define All(a) (a.begin()),(a.end())
#define Zeros(a) memset(a,0,sizeof(a))
#define Minus(a) memset(a,0xff,sizeof(a))

#define PI 3.14159265
#define EPS (1e-10)
#define EPS_eq(a,b) (abs((a)-(b)) < EPS)

#pragma GCC diagnostic ignored "-Wconversion"

//#define int long long
#define INF 1000*1000

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

void pp_int(int x){ printf("%d\n", x); };

int i,j,k;

ll M = 100000009;

//ios::sync_with_stdio(false);

//-------------------------------------------------

vector<int> g[200];
vector<int> qs[200];
int res[200];

void rec(int p, int sum){
    if(g[p].size() == 0){
        res[p] += sum;
        return;
    }
    for(int i=0;i<g[p].size();i++){
        rec(g[p][i], sum * qs[p][i]);
    }
    return;
}

signed main() {
    int n,m;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        int p,q,r;
        cin>>p>>q>>r;
        g[r].push_back(p);
        qs[r].push_back(q);
    }
    rec(n, 1);
    for(int i=1;i<n;i++)
        cout<<res[i]<<endl;
    return 0;
}