//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0xccccccc;
const ll LINF = 922337203685477580LL;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

struct UnionFind {
	vector<int> par; // 親を指すvector,-par[親]は木のサイズ
	vi val;
	UnionFind(int n):par(n, -1), val(n) {} // uniteで親を埋め込んでいく必要あり
	int root(int x) { // 親をたどる&データの整理
		if(par[x] < 0) return x;
		int u = root(par[x]);
		if(par[x] != u) val[x] += val[par[x]];
		return par[x] = u;
	}
	bool unite(int x, int y) { // データの結合
		x = root(x);
		y = root(y);
		if(x == y) return false;
		if(par[x] > par[y]) swap(x, y);
		val[y] -= val[x];
		par[x] += par[y];
		par[y] = x;
		return true;
	}
	bool same(int x, int y) {return root(x) == root(y);} // 所属判定
	int size(int x) {return -par[root(x)];} // 木のサイズ
	void add(int a, int b) {val[root(a)] += b;}
	int query(int a) {
		if(a == root(a)) return val[a];
		return val[a] + val[root(a)];
	}
};

//head

int n, q;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> q;
	UnionFind uft(n);
	rep(i, q) {
		int t, a, b;
		cin >> t >> a >> b;
		if(t == 1) {
			uft.unite(a-1, b-1);
		}
		if(t == 2) {
			uft.add(a-1, b);
		}
		if(t == 3) {
			cout << uft.query(a-1) << '\n';
		}
	}
}