#include using namespace std; #define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++) #define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n,m;cin>>n>>m; map> mp1,mp2; mapkk,kb; rep(i,0,m){ ll u,v; cin>>u>>v; mp1[u].insert(v); mp2[v].insert(u); } ll op=n; ll q;cin>>q; while(q--){ ll c,a,b;cin>>c>>a>>b; if(c==1){ if(mp1[a].count(b)){ mp1[a].erase(b); mp2[b].erase(a); if(kb[b]==1) kk[a]--; }else{ mp1[a].insert(b); mp2[b].insert(a); if(kb[b]==1) kk[a]++; } }else{ if(kb[a]==0){ kb[a]=1; for(ll i:mp2[a]) kk[i]++; op--; }else{ kb[a]=0; for(ll i:mp2[a]) kk[i]--; op++; } } ll ans = (op - 1 + kb[a]) + kk[a]; cout << ans << el; } }