import sys
input = sys.stdin.readline

from collections import defaultdict

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

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            if P[x]!=self.parents[x]:
                L[x]=L[P[x]]+L[x]
                P[x]=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.parents[y] = x
        P[y]=x
        L[y]=L[x]-L[y]

    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):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

N,Q = map(int,input().split())
uf = UnionFind(N+1)
L = [0]*(N+1)
P = [-1]*(N+1)

for _ in range(Q):
    t,a,b = map(int,input().split())
    if t==1:
        uf.union(a,b)
    if t==2:
        p = uf.find(a)
        L[p]+=b
        print(a,b)
    if t==3:
        p = uf.find(a)
        if p==a:
            print(L[a])
        else:
            print(L[p]-L[a])