#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N, Q;
int par[500000];
int sz[500000];
int dat[500000];

int cnt;
int root(int v){
    cnt++;
    return par[v] == v ? v : root(par[v]);
}

int calc(int v){
    int ans = dat[v];
    while(v != par[v]){
        v = par[v]; ans += dat[v];
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> Q;
    for(int i = 0; i < N; i++){
        par[i] = i;
        sz[i] = 1;
    }
    for(int i = 0; i < Q; i++){
        cnt = 0;
        
        int t, a, b;
        cin >> t >> a >> b;
        if(t == 1){
            a--; b--;
            int ra = root(a), rb = root(b);
            if(ra != rb){
                if(sz[ra] > sz[rb]) swap(ra, rb);
                par[ra] = rb;
                dat[ra] -= dat[rb];
                sz[rb] += sz[rb]; 
            }
        }else if(t == 2) {
            a--;
            int r = root(a);
            dat[r] += b;
        }else{
            a--;
            cout << calc(a) << endl;
        }
    }
}