import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict, Counter
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


class UnionFind:
    def __init__(self, N):
        self.N = N
        self.par = [-1] * N
        self.members = [[i] for i in range(N)]
        self.value = [0] * N
        self.lazy = [0] * N

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

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

        if x == y:
            return False
        if x > y:
            x, y = y, x

        for i in self.members[y]:
            self.value[i] += self.lazy[y] - self.lazy[x]
        self.lazy[y] = 0

        self.par[x] += self.par[y]
        self.par[y] = x
        self.members[x] += self.members[y]
        return True

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

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

    def roots(self):
        return [i for i in range(self.N) if self.par[i] < 0]


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, Q = map(int, input().split())
uf = UnionFind(N)
for _ in range(Q):
    t, a, b = map(int, input().split())
    if t == 1:
        a -= 1
        b -= 1
        uf.unite(a, b)
    elif t == 2:
        a -= 1
        p = uf.find(a)
        uf.lazy[p] += b
    else:
        a -= 1
        p = uf.find(a)
        print(uf.value[a] + uf.lazy[p])