#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
using ii = pair<int, i64>;

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<set<ii>> ins(n), outs(n);
    for (int i = 0; i < m; i++) {
        int a, w, b;
        cin >> a >> w >> b;
        a--;
        b--;
        ins[b].insert(ii(a, w));
        outs[a].insert(ii(b, w));
    }

    vi needs(n), visited(n);
    needs.back() = 1;

    while (1) {
        int change = 0;
        for (int i = 0; i < n; i++) {
            if (visited[i]) continue;
            if (outs[i].empty()) {
                // cout << "Found empty: " << i << endl;
                visited[i] = 1;
                // if (needs[i] == 0) continue;
                for (auto& e: ins[i]) {
                    int k = e.first;
                    // cout << "node " << k << " is going to " << i << " with cost " << e.second << endl;  
                    needs[k] += needs[i] * e.second;
                    // cout << "need[k] has updated: " << needs[k] << endl;
                    outs[k].erase(ii(i, e.second));
                }
                change = 1;
            }
        }
        if (!change) break;
    }
    for (int i = 0; i < n - 1; i++) {
        // cout << needs[i] << endl;
        cout << (ins[i].empty() ? needs[i] : 0) << endl;
    }
}