#pragma GCC optimize("O3")

//import std;
#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vb = vector<bool>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;

struct uv { ll u; ll v; }; struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

template <class T> requires std::is_base_of_v<atcoder::internal::modint_base, T> ostream& operator<<(ostream& os, const T& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<class T> void ovn(const T& v) { ov(v); cout << "\n"; };

const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	LI(n, m);
	VUVI(eg, m);

	map<ll, ll> follower_count;
	REP(i, m) {
		follower_count[eg[i].v]++;
	}
	vb pub(n, true);//最初は全員公開
	map<ll, ll> unpub_followee_count;
	ll pubuser = n;

	//フォロワーが多い人は、相手側から都度チェックする
	//フォロワーが少ない人は、変更時に相手側を変更する
	map<ll, set<ll>> followees;
	map<ll, set<ll>> followers;
	ll border = 400;
	REP(i, m) {
		if (follower_count[eg[i].v] > border) {
			followees[eg[i].u].insert(eg[i].v);
		}
		else {
			followers[eg[i].v].insert(eg[i].u);
		}
	}

	LI(Q);
	REP(_, Q) {
		LI(q, a, b);
		a--; b--;

		if (q == 1) {
			if (myat(follower_count, b) > border) {
				auto& x = followees[a];
				if (x.find(b) == x.end()) {
					x.insert(b);
				}
				else {
					x.erase(b);
				}
			}
			else {
				auto& x = followers[b];
				if (x.find(a) == x.end()) {
					x.insert(a);
					if (!pub[b]) unpub_followee_count[a]++;
				}
				else {
					x.erase(a);
					if (!pub[b]) unpub_followee_count[a]--;
				}
			}
		}
		else {
			pub[a] = !pub[a];

			if (pub[a]) {
				pubuser++;
			}
			else {
				pubuser--;
			}

			if (myat(follower_count, a) <= border) {
				auto& x = followers[a];
				if (pub[a]) {
					//公開に変更
					for (auto& f : x) {
						unpub_followee_count[f]--;
					}
				}
				else {
					//非公開に変更
					for (auto& f : x) {
						unpub_followee_count[f]++;
					}
				}
			}
		}

		ll res = pubuser;
		if (pub[a]) res--;
		auto x = myat(followees, a);
		REPE(f, x) {
			if (!pub[f]) res++;
		}

		cout << res + myat(unpub_followee_count, a) << "\n";

	}


}