#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){

    int n, m; cin >> n >> m;
    map<int, set<int>> mf;
    rep(i, m){
        int u, v; cin >> u >> v;
        mf[u].insert(v);
    }
    set<int> sec;
    int q; cin >> q;
    while(q--){
        int i, a, b; cin >> i >> a >> b;
        if(i == 1){
            if(mf[a].count(b)){
                mf[a].erase(b);
            }else{
                mf[a].insert(b);
            }
        }else{
            if(sec.count(a)){
                sec.erase(a);
            }else{
                sec.insert(a);
            }
        }
        int c = 0;
        for(auto j : mf[a]){
            if(!sec.count(j))c++;
        }
        int al = n - sec.size();
        if(!sec.count(a))al--;
        cout << al + mf[a].size() - c << endl;
    }
    return 0;
}