import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static Scanner scan = new Scanner(System.in);
	static UnionFind union;
	static int N, Q;
	
	public static void main(String[] args) {
		N = scan.nextInt();
		Q = scan.nextInt();
		union = new UnionFind(N);
		
		for(int i=0; i<Q; i++) {
			int T = scan.nextInt();
			int A = scan.nextInt();
			int B = scan.nextInt();
			if(T == 1) {
				union.unite(A-1, B-1);
			} else if(T == 2) {
				union.add(A-1, B);
			} else if(T == 3) {
				union.out(A-1);
			}
		}
		union.flush();
	}
}

class UnionFind {
	int[] L;
	long[] V;
	StringBuilder sb = new StringBuilder();
	
	UnionFind(int N) {
		L = new int[N];
		V = new long[N];
		Arrays.fill(L, -1);
	}
	
	int root(int x) {
		return L[x] < 0 ? x : root(L[x]);
	}

	boolean same(int x, int y) {
		return root(x) == root(y);
	}

	void unite(int x, int y) {
		x = root(x);
		y = root(y);
		if (x == y) {
			return;
		}
		if (L[x] < L[y]) {
			int w = x;
			x = y;
			y = w;
		}
		L[y] += L[x];
		L[x] = y;
		V[x] -= V[y];
	}
	
	void add(int x, int value) {
		x = root(x);
		V[x] += value;
	}
	
	void out(int x) {
		long ans = 0;
		while(true){
			ans += V[x];
			x = L[x];
			if(x < 0) break;
		}
		sb.append(ans);
		sb.append("\n");
	}
	
	void flush() {
		System.out.println(sb.toString().trim());
	}
}