#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;

struct UnionFind {
    vector<int> parent;
    vector<int> A; // 個別
    vector<int> B; // 全体
    vector<vector<int>> vec;
    int size;
    UnionFind(int size):size(size) {
        reset(size);
    }
    void reset(int size) {
        this->size = size;
        parent.resize(size);
        A.resize(size, 0);
        B.resize(size, 0);
        vec.resize(size);
        REP(i,size) parent[i]=i;
        REP(i,size) vec[i].push_back(i);
    }
    int root(int i) {
        if (parent[i] == i) return i;
        return parent[i] = root(parent[i]);
    }
    void merge(int i, int j) {
        int ir = root(i);
        int jr = root(j);
        if (ir == jr) return;
        int next = vec[ir].size() >= vec[jr].size() ? ir : jr;
        int hide = (ir == next) ? jr : ir;
        // hideの中身をnextにマージ
        for (int i:vec[hide]) {
            A[i] += B[hide] - B[next]; // 差分更新
            vec[next].push_back(i);
        }
        vec[hide].clear();
        parent[ir] = parent[jr] = next;
    }
    bool same(int i, int j) {
        return root(i) == root(j);
    }
    void add(int i, int a) {
        B[root(i)] += a;
    }
    int val(int i) {
        return A[i] + B[root(i)];
    }
};

void solve() {
    cin>>N>>Q;
    int T,A,B;
    auto uf = UnionFind(N);
    REP(q,Q) {
        cin>>T>>A>>B;
        A--;
        if (T==1) {
            B--;
            uf.merge(A, B);
        }
        if (T==2) {
            uf.add(A, B);
        }
        if (T==3) {
            out("%lld\n", uf.val(A));
        }
    }
}