#include<bits/stdc++.h>
using namespace std;
int n,q;
int a[200005];
bool is_fixed[200005];
map<int,int> m;
int cnt = 0;
struct node
{
	int x;
	bool operator <(const node &b)const
	{
		return x > b.x;
	}
};
set<node> s;
signed main()
{
	//freopen("s.in","r",stdin);
	scanf("%d%d",&n,&q);
	while(q--)
	{
		int opt;
		scanf("%d",&opt);
		if(opt == 1)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			if(m[x] == 0) m[x] = ++cnt;
			x = m[x];
			if(m[y] == 0) m[y] = ++cnt;
			y = m[y];
			s.erase(node{a[x]});
			s.erase(node{a[y]});
			a[x] = max(a[x],a[y]);
			a[y] = 0;
			s.insert(node{a[x]});
			s.insert(node{a[y]});
		}
		else
		{
			int u,v;
			scanf("%d%d",&u,&v);
			if(m[u] == 0) m[u] = ++cnt;
			u = m[u];
			s.erase(node{a[u]});
			a[u] = max(a[u],v);
			s.insert(node{a[u]});
		}
		int tot = 1;
		long long ans = 0;
		for(auto it : s)
		{
			tot++;
			if(tot > 21) break;
			ans += it.x;
		}
		printf("%lld\n",ans);
	}
	return 0;
}