#include <cassert>
#include <iostream>
#include <vector>
#include <atcoder/dsu>
using namespace std;
using ll = long long;
int main() {
	int N, Q;
	cin >> N >> Q;
	atcoder::dsu uf(N);
	vector<int> ans(N);
	vector<vector<int>> G(N);
	for(int i = 0; i < N; i++) G[i].push_back(i);
	vector<int> Add(N);
	while(Q--) {
		int t, a, b;
		cin >> t >> a >> b;
		a--;
		if(t == 1) {
			b--;
			int la = uf.leader(a), lb = uf.leader(b);
			if(la == lb) continue;
			int nv = uf.merge(a, b);
			int other = la ^ lb ^ nv;
			for(int i = 0; i < G[other].size(); i++) {
				ans[G[other][i]] += Add[other] - Add[nv];
				G[nv].push_back(G[other][i]);
			}
			G[other].clear();
			Add[other] = 0;
		} else if(t == 2) {
			int la = uf.leader(a);
			Add[la] += b;
		} else {
			cout << ans[a] + Add[uf.leader(a)] << '\n';
		}
	}
}