#include <bits/stdc++.h>
using namespace std;

vector<int> topolo(vector<vector<pair<int,long long>>> &Graph){
    int siz = Graph.size();
    vector<int> ret,inV(siz);
    for(auto u : Graph) for(auto [to,w] : u) inV.at(to)++;
    queue<int> Q;
    for(int i=siz-1; i<siz; i++) if(inV.at(i) == 0) Q.push(i);
    while(Q.size()){
        int pos = Q.front(); Q.pop();
        ret.push_back(pos);
        for(auto [to,w] : Graph.at(pos)){
            inV.at(to)--;
            if(inV.at(to) == 0) Q.push(to);
        }
    }
    return ret;
}

vector<long long> BFS(vector<vector<pair<int,long long>>> &Graph,int start){
    int N = Graph.size();
    vector<long long> ret(N,-1);
    queue<int> Q;
    ret.at(start) = 0,Q.push(start);
    while(Q.size()){
        int pos = Q.front(); Q.pop();
        for(auto [to,w] : Graph.at(pos)){
            if(ret.at(to) != -1) continue;
            ret.at(to) = ret.at(pos)+1;
            Q.push(to);
        }
    }
    return ret;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int N,M; cin >> N >> M;
    vector<vector<pair<int,long long>>> Graph(N),G(N);
    for(int i=0; i<M; i++){
        int a,b,c; cin >> a >> b >> c; a--; c--;
        G.at(c).push_back({a,b});
    }
    vector<long long> need = BFS(G,N-1);
    for(int i=0; i<N; i++) if(need.at(i) != -1) for(auto [to,w] : G.at(i)) Graph.at(i).push_back({to,w});

    auto topo = topolo(Graph);
    need.assign(N,0);
     need.at(N-1) = 1;
    for(auto pos : topo) for(auto [to,w] : Graph.at(pos)) need.at(to) += need.at(pos)*w;
    for(int i=0; i<N-1; i++){
        if(Graph.at(i).size()) cout << "0\n";
        else cout << need.at(i) << "\n";
    }
}