import sys
input = sys.stdin.readline

class UnionFind():
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]
        self.p = [0 for _ in range(n)]
        self.ans = [0 for _ in range(n)]
        self.mem = [[i] for i in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            while self.mem[y]:
                v = self.mem[y].pop()
                self.ans[v] += self.p[y] - self.p[x] 
                self.mem[x].append(v)
            self.p[y] = []
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]
    
    def add(self, x, v):
        x = self.find(x)
        self.p[x] += v
        return
    
    def get(self, x):
        return self.p[self.find(x)] + self.ans[x]
        

N, Q = map(int, input().split())
U = UnionFind(N)
for _ in range(Q):
    t, a, b = map(int, input().split())
    a -= 1
    if t == 1:
        U.union(a, b - 1)
    elif t == 2:
        U.add(a, b)
    else:
        print(U.get(a))