#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

#include <bits/extc++.h>
using namespace __gnu_pbds;
template <class T>using binary_search_tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q, ans = 1;
    cin >> n >> q;
    vector<int> used(n, 1 << 30);
    vector<binary_search_tree<pair<int,int>>> g(n);
    queue<int> que;
    used[0] = 0;
    for(int i = 0; i < q; i++){
        int p, u, v;
        cin >> p >> u >> v;
        u--, v--;
        g[u].insert({p, v});
        g[v].insert({p, u});
        que.emplace(u);
        que.emplace(v);
        while(!que.empty()){
            int v = que.front();
            que.pop();
            auto it = g[v].lower_bound(make_pair(used[v], -1));
            while(it != g[v].end()){
                auto [w, u] = *it;
                if(w < used[u]){
                    ans += used[u] >> 30;
                    used[u] = w;
                    que.emplace(u);
                }
                g[v].erase(it++);
            }
        }
        cout << ans << '\n';
    }
}