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

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin, n, q;
    vector<ll> sroot(n, 0), val(n, 0);
    vector<int> root(n, -1);
    vector<vector<int>> child(n);
    rep(i, 0, n) {
        root[i] = i;
    }
    rep(i, 0, n) {
        child[i].push_back(i);
    }

    rep(i, 0, q) {
        int t, a, b;
        cin, t, a, b;
        a--;
        if (t == 1) {
            b--;
            a = root[a];
            b = root[b];
            if (a == b) continue;
            if (child[a].size() > child[b].size()) swap(a, b);
            // a < b
            for (auto v : child[a]) {
                child[b].push_back(v);
                root[v] = b;
                val[v] += sroot[a] - sroot[b];
            }
            child[a].clear();
        } else if (t == 2) {
            a = root[a];
            sroot[a] += b;
        } else {
            print(sroot[root[a]] + val[a]);
        }
    }

    return 0;
}