#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 1000000007LL
#define MAX 502
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;



//UnionFind
class UnionFind
{
public:
    vector<int> parent;
    vector<int> cnt;
    vector<long> value;
    void init(int size)
    {
        parent.resize(size);
        cnt.resize(size);
        value.resize(size);
        for(int i = 0; i<size; i++)
        {
            parent[i] = i;
            cnt[i] = 1;
        }
    }
    int find(int x)
    {
        if(parent[x] == x)
            return x;
        return find(parent[x]);
    }
    void merge(int x, int y)
    {
        x = find(x);
        y = find(y);
        if(x == y)
            return;
        
        if(cnt[x] == cnt[y])
            cnt[x]++;
        if(cnt[x] > cnt[y])
        {
            parent[y] = x;
            value[y]-=value[x];
        }
        else
        {
            parent[x] = y;
            value[x]-=value[y];
        }
    }
    void update(int x, int v)
    {
        x = find(x);
        value[x]+=v;
    }
    long findSum(int x)
    {
        if(parent[x] == x)
            return value[x];
        return findSum(parent[x])+value[x];
    }
};

int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);

    int n,q;
    cin >> n >> q;

    UnionFind uf;
    uf.init(n+1);
    while(q--)
    {
        int t,a,b;
        cin >> t >> a >> b;

        if(t == 1)
        {
            uf.merge(a,b);
        }
        if(t == 2)
        {
            uf.update(a,b);
        }
        if(t == 3)
        {
            cout << uf.findSum(a) << "\n";
        }
    }
    
    return 0;
}