#include<bits/stdc++.h>
using namespace std;
int fin[1232132];
int now[1232132];
int cha[1231232];
int find(int x){
	if(fin[x]==x) return x;
	if(fin[x]!=fin[fin[x]])
	{
	int l=find(fin[x]);
	now[x]+=now[fin[x]]-cha[x];
	cha[x]=now[l];
	}
	return fin[x]=find(fin[x]);
}
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++) fin[i]=i;
	while(m--){
		int x,y,z;
		cin>>x>>y>>z;
		if(x==1){
		if(find(z)!=find(y))
		{
		if(cha[find(y)]!=0) {
		cha[find(y)]+=now[find(y)]-cha[find(y)];
		}
		cha[find(y)]=now[find(z)];
		fin[find(y)]=find(z);	
		}
		}
		else{
		now[find(y)]+=z;
		}
	}
	for(int i=1;i<=n;i++){
		int l=find(i);
		//cout<<fin[i]<<" "<<now[i]<<" "<<cha[i]<<endl;		
		if(l!=i){
			cout<<now[i]+now[l]-cha[i]<<" ";
		}
		else cout<<now[l]<<" ";
		
	} 
	return 0;
}