#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))

using namespace std;
typedef pair<llint, llint> P;

struct UnionFind{
	int size;
	vector<int> parent, rank, add;
	
	UnionFind(){}
	UnionFind(int size){
		this->size = size;
		parent.resize(size+1);
		rank.resize(size+1);
		add.resize(size+1);
		init();
	}
	void init(){
		for(int i = 0; i <= size; i++) parent[i] = i;
	}
	int root(int i){
		if(parent[i] == i) return i;
		return root(parent[i]);
	}
	bool same(int i, int j){
		return root(i) == root(j);
	}
	void addto(int i, int x){
		add[root(i)] += x;
	}
	int get(int i){
		if(parent[i] == i) return add[i];
		return add[i] + get(parent[i]);
	}
	void unite(int i, int j){
		int root_i = root(i), root_j = root(j);
		if(root_i == root_j) return;
		if(rank[root_i] < rank[root_j]){
			parent[root_i] = root_j; 
			add[root_i] -= add[root_j];
		}else{
			parent[root_j] = root_i;
			add[root_j] -= add[root_i];
			if(rank[root_j] == rank[root_j]) rank[root_i]++;
		}
	}
};

llint n, Q;
UnionFind uf(500005);

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> Q;
	llint t, a, b;
	for(int i = 1; i <= Q; i++){
		cin >> t >> a >> b;
		if(t == 1) uf.unite(a, b);
		if(t == 2) uf.addto(a, b);
		if(t == 3) cout << uf.get(a) << "\n";
	}
	flush(cout);
	
	return 0;
}