import java.io.*;
import java.util.*;
import java.math.*;

public class Main {

	class DJSet {
		int n;
		int[] upper;
		long[] weight;

		public DJSet(int n) {
			this.n = n;
			upper = new int[n];
			weight = new long[n];
			Arrays.fill(upper, -1);
		}

		void add_weight(int x, long w) {
			x = root(x);
			weight[x] += w;
		}

		long get_weight(int x) {
			return weight[x] + (upper[x] < 0 ? 0 : get_weight(upper[x]));
		}

		int root(int x) {
			return upper[x] < 0 ? x : root(upper[x]);
		}

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

		void setUnion(int x, int y) {
			x = root(x);
			y = root(y);
			if (x == y)
				return;
			if (upper[x] < upper[y]) {
				x ^= y;
				y ^= x;
				x ^= y;
			}
			upper[y] += upper[x];
			upper[x] = y;
			weight[x] -= weight[y];
		}
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int Q = sc.nextInt();
		DJSet ds = new DJSet(N);
		PrintWriter pw = new PrintWriter(System.out);
		for (int q = 0; q < Q; ++q) {
			int T = sc.nextInt();
			int A = sc.nextInt();
			int B = sc.nextInt();
			--A;
			if (T == 1) {
				--B;
				if (ds.equiv(A, B))
					continue;
				ds.setUnion(A, B);
			} else if (T == 2) {
				ds.add_weight(A, B);
			} else if (T == 3) {
				pw.println(ds.get_weight(A));
			}
		}
		pw.close();
	}

	public static void main(String[] args) throws FileNotFoundException {
		new Main().run();
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}