#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

vector<int> to[500005];
vector<int> ans;
vector<int> done;
void dfs(int v, int p = -1, int b = 0){
    done[v] = b;
    for(auto u : to[v]){
        if(u == p) continue;
        if(done[u] == b) continue;
        ans[u] += b;
        dfs(u, v, b);
    }
}

int main()
{
    int n, q;
    scanf("%d %d", &n, &q);
    ans.resize(n);
    done.resize(n);
    rep(i, 0, q){
        int t, a, b;
        scanf("%d %d %d", &t, &a, &b);
        a--;
        if(t == 1){
            b--;
            to[a].push_back(b);
            to[b].push_back(a);
        }
        else if(t == 2){
            ans[a] += b;
            done[a] = 1;
            dfs(a, -1, b);
        }
        else{
            printf("%d\n", ans[a]);
        }
    }
    return 0;
}