#include<bits/stdc++.h>
using namespace std;
const int N=1e5+100;
int n,m;
int fa[N];
int value[N];
int d[N];
int find(int x){
if(fa[x]==x) return x;
int root=find(fa[x]);
d[x]+=d[fa[x]];
return fa[x]=root;
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) fa[i]=i;
for(int i=0;i<m;i++){
int a,b;
int op;scanf("%d",&op);
if(op==1){
scanf("%d%d",&a,&b);
if(a==b) continue;
int pa=find(a),pb=find(b);
if(pa==pb) continue;
d[pa]+=value[pa]-value[pb];
fa[pa]=pb;
}
else if(op==2){
scanf("%d%d",&a,&b);
int pa=find(a);
value[pa]+=b;
}
}
for(int i=1;i<=n;i++){
if(i<n)
printf("%d ",value[find(i)]+d[i]);
else
printf("%d\n",value[find(i)]+d[i]);
}
return 0;
}