#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = (s); i < (n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<P>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream& os,const vector<T>& v) { for(T t:v){os<<t<<" ";} os<<"\n"; return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YES(bool b) { cout << (b ? "YES" : "NO") << endl; }
template<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;

class unionfind {
    int n;
    vector<int> par,rank,val;
public:
    unionfind(int n):n(n),par(n,-1),rank(n,0),val(n,0) {}
    int root(int x) {
        if(par[x] < 0) return x;
        else return root(par[x]);
    }
    bool same(int x,int y) { return root(x) == root(y); };
    bool merge(int x,int y) {
        x = root(x); y = root(y);
        if(x == y) return false;
        if(rank[x] < rank[y]) swap(x,y);
        if(rank[x] == rank[y]) rank[x]++;
        par[x] += par[y];
        par[y] = x;
        val[y] -= val[x];
        return true;
    }
    int size(int x) { return -par[root(x)]; };
    bool connected() {
        rep(i,n-1) if(!same(i,i+1)) return false;
        return true;
    }
    void add(int v,int x) { val[root(v)] += x; }
    int get(int v) {
        int ret = 0;
        while(true) {
            ret += val[v];
            if(par[v] < 0) break;
            v = par[v];
        }
        return ret;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int n,q;
    cin >> n >> q;
    unionfind uf(n);
    rep(_,q) {
        int t,a,b;
        cin >> t >> a >> b;
        if(t == 1) {
            a--; b--;
            uf.merge(a,b);
        } else if(t == 2) {
            a--;
            uf.add(a,b);
        } else {
            a--;
            cout << uf.get(a) << "\n";
        }
    }
}