#include<bits/stdc++.h>

using namespace std;

#define endl '\n'
#define hh cout<<endl;
#define No cout<<"No"<<endl;
#define Yes cout<<"Yes"<<endl;
#define NO cout<<"NO"<<endl;
#define YES cout<<"YES"<<endl;


#define int long long


map<int,int> m,vis;
int n;
int q;
set<pair<int,int> > s;
int op[444444],x[444444],y[444444];
void solve()
{
	cin>>n>>q;
    int i;
    for(i=1;i<=q;i++)
    {
        cin>>op[i]>>x[i]>>y[i];
        s.insert({0,x[i]});
        if(op[i]==1)
            s.insert({0,y[i]});
    }
    n = s.size();
    for(i=1;i<=q;i++)
    {
        int opt = op[i];
        int cnt;
        if(opt==1)
        {
            s.erase({m[x[i]],x[i]}); s.erase({m[y[i]],y[i]});
            m[x[i]] = max(m[x[i]],m[y[i]]);
            m[y[i]] = 0;
            s.insert({m[x[i]],x[i]}); s.insert({m[y[i]],y[i]});
        }
        else
        {
            s.erase({m[x[i]],x[i]});
            m[x[i]] = max(m[x[i]],y[i]);
            s.insert({m[x[i]],x[i]});
        }
        int ans = 0;
        cnt = 1;
        set<pair<int,int>>::reverse_iterator it = s.rbegin();
        for(;cnt<=min(n,20ll);it++)
        {
            ans += (*it).first;
            cnt++;
        }
        cout<<ans<<endl;
    }
    return;
}
signed main()
{
    int T = 1;
    // cin>>T;
    while(T--)
        solve();
    return 0;
}