import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

struct UnionFind
{
	void init(int n) { par = new int[](n); foreach (i; 0..n) par[i] = i; cnt = new int[](n); fill(cnt, 1); }
	int root(int i) { return par[i] == i ? i : (par[i] = root(par[i])); }
	bool same(int i, int j) { return root(i) == root(j); }
	void unite(int i, int j) { i = root(i); j = root(j); if (i == j) return; par[i] = j; cnt[j] += cnt[i]; }
	int size(int i) { return cnt[root(i)]; }
	int[] par, cnt;
}

void main()
{
	auto N = RD!int;
	auto Q = RD;
	auto tab = new int[][](Q);
	int[int] list;
	foreach (i; 0..Q)
	{
		tab[i] = [RD!int, RD!int-1, RD!int-1];
		if (tab[i][0] == 2)
			++tab[i][2];
		else if (tab[i][0] == 3)
			list[tab[i][1]] = 0;
	}

	auto chi = new int[][](N);
	auto par = new int[][](N);
	foreach (key; list.keys)
	{
		chi[key] ~= key;
		par[key] ~= key;
	}
	auto score = new int[](N);

	UnionFind uf;
	uf.init(N);
	foreach (i; 0..Q)
	{
		//debug writeln(chi);
		//debug writeln(par);
		//debug writeln(score);
		auto t = tab[i][0];
		auto a = tab[i][1];
		auto b = tab[i][2];
		if (t == 1)
		{
			auto lastAP = uf.root(a);
			auto lastBP = uf.root(b);
			if (lastAP == lastBP) continue;
			uf.unite(a, b);
			auto ap = uf.root(a);
			auto bp = uf.root(b);
			//debug writeln("p:", lastAP, " ap:", ap, " bp:", bp);
			if (ap != lastAP)
			{
				chi[bp] ~= chi[lastAP];
				foreach (e; chi[lastAP])
				{
					par[e] ~= bp;
					list[e] -= score[bp];
				}
			}
			else
			{
				chi[ap] ~= chi[lastBP];
				foreach (e; chi[lastBP])
				{
					par[e] ~= ap;
					list[e] -= score[ap];
				}
			}
		}
		else if (t == 2)
		{
			auto p = uf.root(a);
			score[p] += b;
		}
		else
		{
			long s = list[a];
			foreach (e; par[a])
			{
				s += score[e];
			}
			writeln(s);
		}
	}

	stdout.flush;
	debug readln;
}