#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  int N, M;
  cin >> N >> M;
  unordered_map<int, unordered_set<int>> G;
  rep(i, M) {
    int U, V;
    cin >> U >> V;
    G[U].insert(V);
  }
  int allpub = N;
  map<int, int> folclo;
  int Q;
  cin >> Q;
  using ai3 = array<int, 3>;
  vector<ai3> allquery;
  unordered_map<int, int> lastcheck, clo;
  rep(i, Q) {
    int T, A, B;
    cin >> T >> A >> B;

    int l = lastcheck[A];
    rep(j, l, i) {
      auto [t, a, b] = allquery[j];
      if (t == 2) {
        if (G[A].contains(a))
          folclo[A]++;
      } else if (t == 3) {
        if (G[A].contains(a))
          folclo[A]--;
      }
    }
    if (T == 1) {
      if (G[A].contains(B)) {
        if (clo[B])
          folclo[A]--;
        G[A].erase(B);
      } else {
        G[A].insert(B);
        if (clo[B])
          folclo[A]++;
      }
    } else if (T == 2) {
      if (clo[A]) {
        T = 3;
        clo[A] = 0;
        allpub++;
      } else {
        clo[A] = 1;
        allpub--;
      }
    }
    allquery.push_back(ai3{T, A, B});
    lastcheck[A] = i + 1;
    // cerr << A << ':' << allpub << '+' << folclo[A] << "-1+" << clo[A] << '\n';
    cout << allpub + folclo[A] - 1 + clo[A] << '\n';
  }
}