#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

struct UnionFind {
  vector<int> data;
  vector<int> cost;
  vector<vector<int>> vertexes;
  UnionFind(int n) {
    data.assign(n, -1);
    cost.assign(n, 0);
    vertexes.assign(n, vector<int>());
    for (int i = 0; i < n; i++) {
      vertexes[i].push_back(i);
    }
  }
  int root(int k) {
    if (data[k] < 0) return k;
    return data[k] = root(data[k]);
  }
  void merge(int x, int y) {
    int n = vertexes[y].size();
    vector<int> costs(n);
    for (int i = 0; i < n; i++) {
      costs[i] = calc_cost(vertexes[y][i]);
    }
    for (int i = 0; i < n; i++) {
      int v = vertexes[y][i];
      vertexes[x].push_back(v);
      cost[v] = costs[i] - cost[x];
    }
    vertexes[y].clear();
  }
  void unite(int x, int y) {
    x = root(x);
    y = root(y);
    if (x == y) return;
    if (data[x] > data[y]) swap(x, y);
    merge(x, y);
    data[x] += data[y];
    data[y] = x;
  }
  bool same(int x, int y) {
    return root(x) == root(y);
  }
  int size(int k) {
    return -data[root(k)];
  }
  void add_cost(int k, int x) {
    cost[root(k)] += x;
  }
  int calc_cost(int x) {
    if (x == root(x)) return cost[root(x)];
    return cost[root(x)] + cost[x];
  }
};

void solve() {
  int n, q;
  cin >> n >> q;
  UnionFind uf(n);
  rep(i, q) {
    int t, a, b;
    cin >> t >> a >> b;
    if (t == 1) {
      a--, b--;
      uf.unite(a, b);
    } else if (t == 2) {
      a--;
      uf.add_cost(a, b);
    } else {
      a--;
      cout << uf.calc_cost(a) << endl;
    }
  }
}