#include<bits/stdc++.h>
#define gt getchar
#define pt putchar
#define int long long
#define ull unsigned long long
#define fst first
#define snd second
#define mkp(x,y) make_pair(x,y) 
#define L(x) x<<1
#define R(x) x<<1|1
using namespace std;
typedef pair<int,int> pii;
const double eps=1e-6;
inline bool pts(char ch){return ch>=48&&ch<=57;}
inline int read(){
	bool f=0;int x=0;char ch;
	ch=gt();
	while(!pts(ch)&&ch!=EOF){if(ch=='-')f=1;ch=gt();}
	while(pts(ch)){x*=10;x+=(ch-48);ch=gt();}
	if(f)return -x;
	else return x;
}
template<class T>
inline void print(T x){
	char s[114];
	int top=0;
	if(x<0)pt('-');
	do{
		top++;
		if(x>=0)s[top]=(x%10)+48;
		else s[top]=(-(x%10)+48);
		x/=10;
	}while(x);
	while(top){pt(s[top]);top--;}
}
//__gnu_pbds::tree<pii,__gnu_pbds::null_type,greater<pii>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update> phs;
signed main(){
	int n=read(),q=read();
	set<pii,greater<pii> >com;
	map<int,int>nl;
	while(q--){
		int opt=read();
		if(opt==1){
			int x=read(),y=read();
			com.erase(mkp(nl[x],x));
			com.erase(mkp(nl[y],y));
			nl[x]=max(nl[y],nl[x]);
			nl[y]=0;
			com.insert(mkp(nl[x],x));
		}
		else{
			int u=read(),v=read();
			com.erase(mkp(nl[u],u));
			nl[u]=max(nl[u],v);
			com.insert(mkp(nl[u],u));
		}
		int sum=0;
		if(com.size()<=20){
			for(auto k:com)
				sum+=k.fst;
			cout<<sum<<'\n';
		}
		else{
			int i=0;
			for(auto k:com){
				i++;
				sum+=k.fst;
				if(i>=20)break;
			}
			cout<<sum<<'\n';
		}
	}
	return 0;
}