//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int n, m, k;
int op[N], a[N], b[N];
int p[N];
vector < int > g[N];
int ans[N];
int u[N];
vector < int > add[N], q[N];

int get (int x) {
	if (p[x] != x) p[x] = get(p[x]);
	return p[x];
}
int f[N];
int id[N];
void upd (int p, int x) {
	for(; p < N; p |= (p+1))
		f[p] += x;
}

int query (int r) {
	int res = 0;
	while(r > 0) {
		res += f[r];
		r = (r&(r+1)) - 1;
	}

	return res;
}

void dfs (int v) {
	for (auto it : add[v]) {
	//	cout << "+ " <<  it << '\n';
		upd(it, b[it]);
	}

	for (auto it : q[v]) {
		ans[it] = query(it);
	//	cout << "que: " << it << '\n';
	}
	int ptr = 0;
	for (auto to : g[v]) { 
	    while(ptr < sz(add[v]) && id[to] > add[v][ptr]) {
	    	auto it = add[v][ptr++];
	    	upd(it, -b[it]);
	//    	cout << "- " <<  it << '\n';
	    }
	 	dfs(to);
	}
	while(ptr < sz(add[v])) {
		auto it = add[v][ptr++];
	    upd(it, -b[it]);
	//    cout << "- " <<  it << '\n';
	}


	
}

int main () {
	scanf("%d%d", &n, &m);
	For (i, 1, m) {
		scanf("%d%d%d", &op[i], &a[i], &b[i]);
	}

	For (i, 1, n) p[i] = i;

	For(i, 1, m) if (op[i] == 1) {
		int x = get(a[i]), y = get(b[i]);
		if (x > y) swap(x, y);

		g[x].pb(y);
		id[y] = i;
		p[y] = x;

	} else if (op[i] == 2) {
		int x = get(a[i]);
		add[x].pb(i);
	} else {
		//int x = get(a[i]);
		q[a[i]].pb(i);
	}

	For (i, 1, n) {
		if(p[i] == i) {
			dfs(i);
		}
	}

	For (i, 1, m) if(op[i] == 3) {
		printf("%d\n", ans[i]);
	}


	return Accepted;
}

// B...a