import java.util.*; import java.io.*; public class Main { public static void main (String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] first = br.readLine().split(" ", 2); int n = Integer.parseInt(first[0]); int q = Integer.parseInt(first[1]); UnionFindTree uft = new UnionFindTree(n); StringBuilder sb = new StringBuilder(); for (int i = 0; i < q; i++) { String[] line = br.readLine().split(" ", 3); int type = Integer.parseInt(line[0]); int a = Integer.parseInt(line[1]); int b = Integer.parseInt(line[2]); if (type == 1) { uft.unite(a - 1, b - 1); } else if (type == 2) { uft.add(a - 1, b); } else { sb.append(uft.get(a - 1)).append("\n"); } } System.out.print(sb); } static class UnionFindTree { int[] parents; int[] ranks; int[] points; public UnionFindTree(int size) { parents = new int[size]; ranks = new int[size]; points = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (parents[x] == x) { return x; } else { points[x] += innerGet(parents[x]); return parents[x] = find(parents[x]); } } private int innerGet(int x) { if (parents[x] == x) { return 0; } else { points[x] += innerGet(parents[x]); return points[x]; } } public void unite(int x, int y) { int xx = find(x); int yy = find(y); if (xx == yy) { return; } if (ranks[xx] < ranks[yy]) { parents[xx] = yy; points[xx] -= points[yy]; ranks[yy] = Math.max(ranks[yy], ranks[xx] + 1); } else { parents[yy] = xx; points[yy] -= points[xx]; ranks[xx] = Math.max(ranks[xx], ranks[yy] + 1); } } public void add(int x, int value) { points[find(x)] += value; } public int get(int x) { if (parents[x] == x) { return points[x]; } else { return points[find(x)] + points[x]; } } } }