#include <iostream>
#include <vector>
#include <atcoder/scc>
using namespace std;
using ll=long long;
int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n,m;
	cin>>n>>m;
	vector<vector<pair<int,int>>> graph(2*n);
	atcoder::scc_graph g(2*n);
	for(int i=0;i<m;i++){
		int u,v,c;
		cin>>u>>v>>c;
		u--;v--;
		graph[u].push_back(make_pair(v+n,2*c-1));
		graph[u+n].push_back(make_pair(v,1-2*c));
		g.add_edge(u,v+n);
		g.add_edge(u+n,v);
	}
	auto sccs=g.scc();
	int k=sccs.size();
	int inf=1e9;
	vector<int> pot(2*n,inf);
	vector<int> sccid(2*n,-1);

	// そのSCCに非零閉路が存在するかどうか
	vector<bool> bad(k);
	vector<vector<pair<int,int>>> biggraph(k);
	for(int i=0;i<k;i++){
		auto scc=sccs[i];
		for(int x:scc)sccid[x]=i;
		pot[scc[0]]=0;
		
		// 非零閉路があるとtrue,そうでなければfalse
		auto dfs=[&](auto dfs,int x)->bool{
			for(auto[y,w]:graph[x]){
				if(sccid[y]!=i)continue;
				if(pot[y]==inf){
					pot[y]=pot[x]+w;
					if(dfs(dfs,y))return true;
				}else if(pot[y]!=pot[x]+w)return true;
			}
			return false;
		};
		if(dfs(dfs,scc[0]))bad[i]=true;
	}
	for(int i=0;i<k;i++){
		auto scc=sccs[i];
		for(int x:scc){
			for(auto[y,w]:graph[x]){
				if(sccid[y]!=i){
					biggraph[i].push_back(make_pair(sccid[y],pot[x]+w-pot[y]));
				}
			}
		}
	}

	vector<bool> reached(k);
	vector<int> maxdp(k,-inf),mindp(k,inf);
	reached[sccid[0]]=true;
	maxdp[sccid[0]]=-pot[0];
	mindp[sccid[0]]=-pot[0];
	for(int i=0;i<k;i++){
		if(!reached[i])continue;
		if(bad[i]){
			for(auto[j,w]:biggraph[i]){
				reached[j]=true;
				bad[j]=true;
			}
		}else{
			for(auto[j,w]:biggraph[i]){
				reached[j]=true;
				maxdp[j]=max(maxdp[j],maxdp[i]+w);
				mindp[j]=min(mindp[j],mindp[i]+w);
			}
		}
	}
	for(int i=0;i<n;i++){
		if(bad[sccid[i]]||bad[sccid[i+n]])cout<<-1<<endl;
		else{
			int ans=0;
			if(reached[sccid[i]])ans=max({ans,maxdp[sccid[i]]+pot[i],-(mindp[sccid[i]]+pot[i])});
			if(reached[sccid[i+n]])ans=max({ans,maxdp[sccid[i+n]]+pot[i+n],-(mindp[sccid[i+n]]+pot[i+n])});
			cout<<ans<<endl;
		}
	}
}