class UnionFind:
    def __init__(self, n):
        self.parent = list(range(n)) #親ノード
        self.size = [1]*n #グループの要素数
        self.lazy = [0]*n
 
    def root(self, x): #root(x): xの根ノードを返す．
        while self.parent[x] != x:
            #self.parent[x] = self.parent[self.parent[x]]
            x = self.parent[x]
        return x 
 
    def merge(self, x, y): #merge(x,y): xのいる組とyのいる組をまとめる
        x, y = self.root(x), self.root(y)
        if x == y: return False
        if self.size[x] < self.size[y]: x,y=y,x #xの要素数が大きいように
        self.size[x] += self.size[y] #xの要素数を更新
        self.parent[y] = x #yをxにつなぐ
        self.lazy[y] -= self.get(x)
        return True
 
    def issame(self, x, y): #same(x,y): xとyが同じ組ならTrue
        return self.root(x) == self.root(y)
        
    def getsize(self,x): #size(x): xのいるグループの要素数を返す
        return self.size[self.root(x)]

    def add(self,x,b):
        self.lazy[self.root(x)] += b

    def get(self,x):
        v = 0
        while self.parent[x] != x:
            v += self.lazy[x]
            x = self.parent[x]
        return v + self.lazy[x]


        
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline 

n,q,*m = list(map(int,read().split()))
M = iter(m)

UF = UnionFind(n)

for t,a,b in zip(M,M,M):
    if t==1:
        UF.merge(a-1,b-1)
    elif t==2:
        UF.add(a-1,b)
    else:
        print(UF.get(a-1))
    #print(*(UF.root(i) for i in range(n)))
    #print(UF.lazy)