import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

void bAdd(T)(T[] bit, int pos, T val)
in {
  assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold");
}
do {
  for (int x = pos; x < bit.length; x |= x + 1) {
    bit[x] += val;
  }
}

// sum of [0, pos)
T bSum(T)(T[] bit, int pos)
in {
  assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold");
}
do {
  T ret = 0;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    ret += bit[x];
  }
  return ret;
}

int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

int V;
int[][] graph;
int zeit;
int[] dis, fin;

void dfs(int u) {
  dis[u] = zeit++;
  foreach (v; graph[u]) {
    dfs(v);
  }
  fin[u] = zeit++;
}

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const Q = readInt();
      auto T = new int[Q];
      auto A = new int[Q];
      auto B = new int[Q];
      foreach (q; 0 .. Q) {
        T[q] = readInt();
        A[q] = readInt();
        B[q] = readInt();
        --A[q];
        if (T[q] == 1) {
          --B[q];
        }
      }
      
      auto as = new int[Q];
      as[] = -1;
      auto uf = new int[N];
      uf[] = -1;
      auto us = iota(N).array;
      V = N;
      graph = new int[][2 * N - 1];
      foreach (q; 0 .. Q) {
        if (T[q] == 1) {
          const ra = uf.root(A[q]);
          const rb = uf.root(B[q]);
          if (ra != rb) {
            uf.connect(ra, rb);
            const u = V++;
            graph[u] ~= us[ra];
            graph[u] ~= us[rb];
            us[uf.root(ra)] = u;
          }
        } else {
          as[q] = us[uf.root(A[q])];
        }
      }
      zeit = 0;
      dis = new int[V];
      fin = new int[V];
      dis[] = -1;
      foreach_reverse (u; 0 .. V) {
        if (dis[u] == -1) {
          dfs(u);
        }
      }
      
      auto bit = new long[zeit + 1];
      foreach (q; 0 .. Q) {
        if (T[q] == 2) {
          bit.bAdd(dis[as[q]], +B[q]);
          bit.bAdd(fin[as[q]], -B[q]);
        } else if (T[q] == 3) {
          const ans = bit.bSum(fin[A[q]]);
          writeln(ans);
        }
      }
    }
  } catch (EOFException e) {
  }
}