#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <numeric>

template <class T, class U>
inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

template <class T, class U>
inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

// [l, r) from l to r
struct range {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { ++i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr range(int l_, int r_): l(l_), r(std::max(l_, r_)) { }
  constexpr itr begin() const { return l; }
  constexpr itr end() const { return r; }
};

// [l, r) from r to l
struct revrange {
  struct itr {
    int i;
    constexpr itr(int i_): i(i_) { }
    constexpr void operator ++ () { --i; }
    constexpr int operator * () const { return i; }
    constexpr bool operator != (itr x) const { return i != x.i; }
  };
  const itr l, r;
  constexpr revrange(int l_, int r_): l(l_ - 1), r(std::max(l_, r_) - 1) { }
  constexpr itr begin() const { return r; }
  constexpr itr end() const { return l; }
};

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  int N, Q;
  std::cin >> N >> Q;
  std::vector<int> parent(N, -1);
  std::vector<int> weight(N);
  auto find = [&](int x) {
    while (parent[x] >= 0) {
      x = parent[x];
    }
    return x;
  };
  auto add = [&](int x, int v) {
    weight[find(x)] += v;
  };
  auto unite = [&](int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) {
      return;
    }
    if (parent[x] > parent[y]) {
      std::swap(x, y);
    }
    parent[x] += parent[y];
    parent[y] = x;
    weight[y] -= weight[x];
  };
  auto fold = [&](int x) {
    int res = weight[x];
    while (parent[x] >= 0) {
      x = parent[x];
      res += weight[x];
    }
    return res;
  };
  while (Q--) {
    int t;
    std::cin >> t;
    if (t == 1) {
      int a, b;
      std::cin >> a >> b;
      --a; --b;
      unite(a, b);
    }
    else if (t == 2) {
      int a, b;
      std::cin >> a >> b;
      --a;
      add(a, b);
    }
    else {
      int a, b;
      std::cin >> a >> b;
      --a; --b;
      std::cout << fold(a) << '\n';
    }
  }
  return 0;
}