#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e4+5;
int n,m,ans[N],sum[N],fa[N];
int find(int x){
	if(fa[x]==x) return x;
	return fa[x]=find(fa[x]);
}
void unionn(int x,int y){
	x=find(x),y=find(y);
	if(x!=y)
		fa[x]=y;
	find(x),find(y);
	return ;
}
signed main() {
    ios::sync_with_stdio(false);
    cin>>n>>m;
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=1;i<=m;i++){
    	int op,a,b;
    	cin>>op>>a>>b;
    	if(op==1){
			for(int i=1;i<=n;i++) ans[i]+=sum[fa[i]];
			unionn(a,b);
			memset(sum,0,sizeof(sum));
		}
		else sum[fa[a]]+=b;
	}
	for(int i=1;i<=n;i++) cout<<ans[i]+sum[fa[i]]<<" ";
    return 0;
}