#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;


class TakoyakiFactory {
public:
    struct Edge {
        Edge(int t, ll c) : to(t), cost(c) {}
        int to;
        ll  cost;
    };
    void solve(void) {
            int N,M;
            cin>>N>>M;
            // 木を逆にたどればよいだけ
            vector<vector<Edge>> tree(N);

            REP(i,M)
            {
                int p,r;
                ll  q;
                cin>>p>>q>>r;
                --p;
                --r;
                tree[r].emplace_back(p,q);
            }

            vector<ll> sum(N,0);
            function<void(int,ll)> dfs = [&](int x, ll n) {
                if (tree[x].empty())
                {
                    sum[x] += n;
                    return;
                }
                for (auto e : tree[x])
                    dfs(e.to, n*e.cost);
            };
            dfs(N-1,1);
            REP(i,N-1)
                cout<<sum[i]<<endl;
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new TakoyakiFactory();
        obj->solve();
        delete obj;
        return 0;
}
#endif