#![allow(non_snake_case, unused_must_use, unused_imports)]
use std::io::{self, prelude::*};

fn main() {
    let (stdin, stdout) = (io::read_to_string(io::stdin()).unwrap(), io::stdout());
    let (mut stdin, mut buffer) = (stdin.split_whitespace(), io::BufWriter::new(stdout.lock()));

    macro_rules! input {
        ($t: tt, $n: expr) => {
            (0..$n).map(|_| input!($t)).collect::<Vec<_>>()
        };
        (Chars) => {
            input!(String).chars().collect::<Vec<_>>()
        };
        (Usize1) => {
            stdin.next().unwrap().parse::<usize>().unwrap() - 1
        };
        ($t: ty) => {
            stdin.next().unwrap().parse::<$t>().unwrap()
        };
    }

    let N = input!(usize);
    let M = input!(usize);

    let mut graph: std::collections::HashMap<usize, std::collections::HashSet<usize>> =
        std::collections::HashMap::new();

    for _ in 0..M {
        let u = input!(Usize1);
        let v = input!(Usize1);

        graph.entry(u).or_default().insert(v);
    }

    let Q = input!(usize);
    let mut S = std::collections::HashSet::new();

    for _ in 0..Q {
        let q = input!(usize);
        let a = input!(Usize1);

        if q == 1 {
            let b = input!(Usize1);

            let entry = graph.entry(a).or_default();

            if !entry.contains(&b) {
                entry.insert(b);
            } else {
                entry.remove(&b);
            }
        } else {
            let _ = input!(isize);

            if S.contains(&a) {
                S.remove(&a);
            } else {
                S.insert(a);
            }
        }

        let ans = S
            .iter()
            .filter(|&&u| u != a)
            .filter(|&&u| !graph.entry(a).or_default().contains(&u))
            .count();
        writeln!(buffer, "{}", N - 1 - ans);
    }
}