import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)


class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.cumsum = [0] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.cumsum[y] -= self.cumsum[x]
        for v in self.members(y):
            if v == y:
                continue
            self.cumsum[v] += self.cumsum[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

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

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())

    def add(self, x, v):
        self.cumsum[self.find(x)] += v


n, q = map(int, readline().split())
uf = UnionFind(n + 1)
for _ in range(q):
    t, a, b = map(int, readline().split())
    if t == 1:
        uf.union(a, b)
    elif t == 2:
        uf.add(a, b)
    else:
        root = uf.find(a)
        if root == a:
            print(uf.cumsum[root])
        else:
            print(uf.cumsum[uf.find(a)] + uf.cumsum[a])