#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

class Edge
{
public:
    int to, cost;
    Edge(int to0, int cost0){
        to = to0;
        cost = cost0;
    }
};

vector<vector<long long> > memo;

vector<long long> solve(int curr, const vector<vector<Edge> >& edges)
{
    int n = edges.size();
    vector<long long> ret(n, 0);
    if(edges[curr].size() == 0){
        ret[curr] = 1;
        return ret;
    }
    if(!memo[curr].empty())
        return memo[curr];

    for(unsigned i=0; i<edges[curr].size(); ++i){
        vector<long long> v = solve(edges[curr][i].to, edges);
        for(int j=0; j<n; ++j)
            ret[j] += v[j] * edges[curr][i].cost;
    }
    return memo[curr] = ret;
}

int main()
{
    int n, m;
    cin >> n >> m;

    vector<vector<Edge> > edges(n);
    for(int i=0; i<m; ++i){
        int p, q, r;
        cin >> p >> q >> r;
        -- p;
        -- r;
        edges[r].push_back(Edge(p, q));
    }

    memo.assign(n, vector<long long>());
    vector<long long> ret = solve(n-1, edges);
    for(int i=0; i<n-1; ++i)
        cout << ret[i] << endl;

    return 0;
}