#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
#include <type_traits>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

struct UnionFindWithWeights {
  vector<int> data, weights;
  vector<vector<ll>> members;
  vector<ll> adding;
  vector<ll> vals;

  UnionFindWithWeights(int n) : data(n, -1), weights(n, 1) {
    members.resize(n);
    for (int i : range(n)) members[i].push_back(i);
    adding.assign(n, 0);
    vals.assign(n, 0);
  }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  bool find(int x, int y) { return root(x) == root(y); }
  void uni(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      int x0 = x, y0 = y;
      if (weights[x0] < weights[y0]) swap(x0, y0);
      int new_weight = weights[x] + weights[y];

      data[y0] = x0;
      weights[x0] = new_weight;

      for (auto& m : members[y0]) vals[m] += adding[y0] - adding[x0];
      members[x0].insert(members[x0].end(), members[y0].begin(), members[y0].end());
    }
  }
  int weight(int x) { return weights[root(x)]; }
};

namespace solver {

int n, q;
vector<int> ts, as, bs;

void read() {
  cin >> n >> q;
  ts.resize(q);
  as.resize(q);
  bs.resize(q);
  for (int i : range(q)) cin >> ts[i] >> as[i] >> bs[i];
}

using RetType = void;

RetType run() {
  UnionFindWithWeights uf(n + 1);


  for (int i : range(q)) {
    int t = ts[i], a = as[i], b = bs[i];

    dump("Q " << t << " " <<  a << " " << b);
    dump("MEM " << uf.members);
    dump("VAL " << uf.vals);
    dump("ADD " << uf.adding);

    if (t == 1) uf.uni(a, b);

    if (t == 2) {
      a = uf.root(a);
      dump("ROOT " << a << " " << b);
      uf.adding[a] += b;
    }

    if (t == 3) {
      int root = uf.root(a);
      ll val = uf.vals[a] + uf.adding[root];
      cout << val << endl;
    }
  }
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}