#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1000000007;
const ll INF = 1e18;
// int mod = 998244353;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template<typename T, typename U> T pow_(T a, U b) { return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(11);
  int T;
  T = 1;
  while (T--) solve();
}

struct UnionFind {
  vector<int> data;
  int sz;
  UnionFind(int _sz) : data(_sz, -1) { sz = _sz; }
  bool connect(int x, int y) {
      if ((x = root(x)) == (y = root(y))) return false;
      if (data[x] > data[y]) swap(x, y);
      data[x] += data[y]; data[y] = x; sz--;
      return true;
  }
  bool issame(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
  int size() { return sz; }
};

struct BIT { // 0 indexed
  int n;
  vector<int> bit;
  BIT(int n) : n(n) { bit.resize(n); }
  BIT(vector<int> v) {
    n = sz(v);
    bit.resize(n);
    rep(i, n) add(i, v[i]);
  }
  void add(int a, int w) { for (int x = a; x < n; x |= x + 1) bit[x] += w; }
  int sum(int a) { // [0, a)
    int ret = 0;
    for (int x = a - 1; x >= 0; x = (x & (x + 1)) - 1) ret += bit[x];
    return ret;
  }
  int sum(int a, int b) { return sum(b) - sum(a); } // [a, b)
};

int N = 1000010;
// https://kmjp.hatenablog.jp/entry/2020/05/19/0900
// https://yukicoder.me/submissions/482411
void solve() {
  int n;
  cin >> n;
  int Q;
  cin >> Q;
  vector<int> a(Q), b(Q), t(Q);

  vector<int> cur(N);
  rep(i, n) cur[i] = i;
  int u = n;
  vector<vector<int> > G(N);

  // 木の上での区間加算
  // 区間をオイラーツアーで決めた番号でもつ
  // n 以降で頂点番号が大きい, オイラーツアーで言うと ls の番号が小さいほど新しく辺が繋げられたことを意味する
  // 全頂点の cur を変える代わりに, root の cur を変える
  // cur は, [ls[cur], rs[cur]) で区間加算の範囲を示す
  {
    UnionFind uni(N);
    rep(i, Q) {
      cin >> t[i] >> a[i] >> b[i];
      --a[i];
      if (t[i] == 1) {
        --b[i];
        if (!uni.issame(a[i], b[i])) {
          G[u].eb(cur[uni.root(a[i])]);
          G[u].eb(cur[uni.root(b[i])]);
          cur[uni.root(a[i])] = cur[uni.root(b[i])] = u++;
          uni.connect(a[i], b[i]);
        }
      }
    }
  }
  // cerr << u << endl;
  // for (int i = 0; i < u; ++i) { for (int j : G[i]) cerr << j << " "; cerr << endl; }

  UnionFind uni(N);
  vector<int> ls(N, -1), rs(N);

  int idx = 0;
  auto dfs = [&](auto&& dfs, int v) -> void {
    if (ls[v] != -1) return;
    ls[v] = idx++;
    for (int nv : G[v]) dfs(dfs, nv);
    rs[v] = idx;
  };
  for (int i = u - 1; i >= 0; --i) dfs(dfs, i);
  // rep(i, u) cerr << ls[i] << " "; cerr << endl;
  // rep(i, u) cerr << rs[i] << " "; cerr << endl;

  rep(i, N) cur[i] = i;
  u = n;
  BIT bit(N);

  rep(i, Q) {
    // cerr << "i " << i << endl;
    if (t[i] == 1) {
      if (!uni.issame(a[i], b[i])) {
        cur[uni.root(a[i])] = cur[uni.root(b[i])] = u++;
        uni.connect(a[i], b[i]);
      }
    } else if (t[i] == 2) {
      int x = cur[uni.root(a[i])];
      // cerr << "x " << x << " " << ls[x] << " " << rs[x] << endl;
      bit.add(ls[x], b[i]);
      bit.add(rs[x], -b[i]);
    } else {
      // cerr << "lsa " << ls[a[i]] << endl;
      cout << bit.sum(ls[a[i]] + 1) << endl;
    }
  }
}