#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef vector<int> VI;
typedef vector<VI> VVI;

struct edge{
    int from, to, need;
};

int main()
{
    int N,M;
    cin>>N>>M;
    vector<vector<edge> > adj(N);
    VI indeg(N);
    FOR(i,M){
        int P,Q,R;
        cin>>P>>Q>>R;
        P--; R--;
        adj[R].push_back((edge) { R, P, Q });
        indeg[P]++;
    }
    vector<long long> dp(N);
    dp[N - 1] = 1;
    FOR(_,N){
        int next = -1;
        FOR(i,N) if(indeg[i] == 0){
            next = i;
            break;
        }
        //cout<<next<<endl;
        if(next == -1) break;
        indeg[next] = -1;
        int used = 0 ;
        for(const auto& e : adj[next]){
            used = 1;
            indeg[e.to]--;
            dp[e.to] += 1LL * dp[e.from] * e.need;
        }
        if(used) dp[next] = 0;
    }

    FOR(i,N-1) cout<<dp[i]<<endl;

    return 0;
}