def aa(m):
  c=[]
  while m!=uf[m]:
    c.append(m)
    m=uf[m]
  for i in c:
    uf[i]=m
  return m
  

n,q=map(int,input().split())
s=[[i] for i in range(n+1)]
uf=[i for i in range(n+1)]
x=[0]*(n+1)
v=[0]*(n+1)
for i in range(q):
  t,a,b=map(int,input().split())
  if t==1:
    a,b=aa(a),aa(b)
    if len(s[a])<len(s[b]):
      for j in s[a]:
        v[j]-=x[b]-x[a]
      s[b]+=s[a];uf[a]=b
    else:
      for j in s[b]:
        v[j]-=x[a]-x[b]
      s[a]+=s[b];uf[b]=a
  elif t==2:
    x[aa(a)]+=b
  else:
    print(v[a]+x[aa(a)])