#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;

vector<int> G[500500];
int N, Q, T[500500], A[500500], B[500500], P[500500], R[500500], S[500500], E[500500], W[500500];

int find(int x)
{
	if (P[x] != x) P[x] = find(P[x]);
	return P[x];
}

void uni(int x, int y)
{
	x = find(x);
	y = find(y);
	if (x == y) return;
	P[x] = y;
	S[y] = min(S[y], S[x]);
	E[y] = max(E[y], E[x]);
}

void push(int x, int p)
{
	while (x <= N){
		W[x] += p;
		x += x & (-x);
	}
}

int pop(int x)
{
	int r = 0;
	while (x){
		r += W[x];
		x -= x & (-x);
	}
	return r;
}

int main()
{
	scanf("%d %d", &N, &Q);
	for (int i = 0; i < Q; i++) scanf ("%d %d %d", &T[i], &A[i], &B[i]);
	for (int i = 1; i <= N; i++) P[i] = i, G[i] = { i };
	for (int i = 0; i < Q; i++) if (T[i] == 1){
		int x = P[A[i]], y = P[B[i]];
		if (x == y) continue;
		if (G[x].size() > G[y].size()) swap(x, y);
		G[y].insert(G[y].end(), G[x].begin(), G[x].end());
		for (auto &v : G[x]) P[v] = y;
		G[x].clear();
	}
	for (int i = 1, c = 1; i <= N; i++) for (auto &v : G[i]) R[v] = c++;
	for (int i = 1; i <= N; i++){
		P[i] = i; S[i] = R[i]; E[i] = R[i] + 1;
	}
	for (int i = 0; i < Q; i++){
		if (T[i] == 1) uni(A[i], B[i]);
		else if (T[i] == 2){
			int p = find(A[i]);
			push(S[p], B[i]);
			push(E[p], -B[i]);
		}
		else{
			printf ("%d\n", pop(R[A[i]]));
		}
	}

	return 0;
}