#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

vector<vector<int> > g;
vector<int> sum;
vector<bool> visited;

void dfs(int s, int v) {
    if (visited[s]) return;
    sum[s] += v;
    visited[s] = true;
    rep (i, g[s].size()) {
        dfs(g[s][i], v);
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n, q;
    cin >> n >> q;
    g.resize(n);
    sum.resize(n);
    visited.resize(n);
    vector<bool> vi(n, false);
    rep (i, q) {
        int t, a, b;
        cin >> t >> a >> b;
        a--;
        if (t == 1) {
            b--;
            g[a].push_back(b);
            g[b].push_back(a);
        } else if (t == 2) {
            visited = vi;
            dfs(a, b);
        } else {
            cout << sum[a] << endl;
        }
    }
    
    return 0;
}