class UnionFindWithAdd:
    def __init__(self, n: int):
        self.data = [-1] * (n+1)
        self.nexts = [i for i in range(n+1)]
        self.values = [0] * (n+1)

    def root(self, a: int) -> tuple[int, int]:
        if self.data[a] < 0: return a, 0

        par, v = self.root(self.data[a])
        self.data[a] = par
        self.values[a] += v
        return self.data[a], self.values[a]

    def unite(self, a: int, b: int) -> bool:
        pa, _ = self.root(a)
        pb, _ = self.root(b)
        if pa == pb: return False

        if self.data[pa] > self.data[pb]:
            pa, pb = pb, pa
        self.data[pa] += self.data[pb] # pa を pb をつなげる
        self.data[pb] = pa
        self.values[pb] -= self.values[pa]
        self.nexts[pa], self.nexts[pb] = self.nexts[pb], self.nexts[pa]

        return True

    def is_same(self, a: int, b: int) -> bool:
        return self.root(a)[0] == self.root(b)[0]

    def size(self, a: int) -> int:
        """a が属する集合のサイズ"""
        return -self.data[self.root(a)[0]]

    def add(self, a: int, v: int):
        """a が属する集合の全ての要素に v を加算する"""
        pa, _ = self.root(a)
        self.values[pa] += v

    def get_value(self, a: int) -> int:
        pa, _ = self.root(a)
        if pa == a:
            return self.values[a]
        return self.values[a] + self.values[pa]

    def group(self, a: int):
        """a が属する集合"""
        yield a
        x = a
        while self.nexts[x] != a:
            x = self.nexts[x]
            yield x


N, Q = map(int, input().split())

uf = UnionFindWithAdd(N)
for _ in range(Q):
    T, A, B = map(int, input().split())
    match T:
        case 1:
            uf.unite(A-1, B-1)
        case 2:
            uf.add(A-1, B)
        case 3:
            res = uf.get_value(A-1)
            print(res)