description: When you play the game of thrones, you win, or you die. There is no middle ground.
  
  Cersei Lannister, A Game of Thrones by George R. R. Martin
  
  There are n nobles, numbered from 1 to n. Noble i has a power of i. There are also m "friendships". A friendship between nobles a and b is always mutual.
  
  A noble is defined to be vulnerable if both of the following conditions are satisfied: 
  
    * the noble has at least one friend, and 
    * all of that noble's friends have a higher power. 
  
  
  
  You will have to process the following three types of queries. 
  
    1. Add a friendship between nobles u and v. 
    2. Remove a friendship between nobles u and v. 
    3. Calculate the answer to the following process. 
  
  
  
  The process: all vulnerable nobles are simultaneously killed, and all their friendships end. Then, it is possible that new nobles become vulnerable. The process repeats itself until no nobles are vulnerable. It can be proven that the process will end in finite time. After the process is complete, you need to calculate the number of remaining nobles.
  
  Note that the results of the process are not carried over between queries, that is, every process starts with all nobles being alive!
  
  Input
  
  The first line contains the integers n and m (1 ≤ n ≤ 2⋅ 10^5, 0 ≤ m ≤ 2⋅ 10^5) — the number of nobles and number of original friendships respectively.
  
  The next m lines each contain the integers u and v (1 ≤ u,v ≤ n, u ≠ v), describing a friendship. No friendship is listed twice.
  
  The next line contains the integer q (1 ≤ q ≤ 2⋅ {10}^{5}) — the number of queries. 
  
  The next q lines contain the queries themselves, each query has one of the following three formats. 
  
    * 1 u v (1 ≤ u,v ≤ n, u ≠ v) — add a friendship between u and v. It is guaranteed that u and v are not friends at this moment. 
    * 2 u v (1 ≤ u,v ≤ n, u ≠ v) — remove a friendship between u and v. It is guaranteed that u and v are friends at this moment. 
    * 3 — print the answer to the process described in the statement. 
  
  Output
  
  For each type 3 query print one integer to a new line. It is guaranteed that there will be at least one type 3 query.
  
  Examples
  
  Input
  
  
  4 3
  2 1
  1 3
  3 4
  4
  3
  1 2 3
  2 3 1
  3
  
  
  Output
  
  
  2
  1
  
  
  Input
  
  
  4 3
  2 3
  3 4
  4 1
  1
  3
  
  
  Output
  
  
  1
  
  Note
  
  Consider the first example. In the first type 3 query, we have the diagram below.
  
  In the first round of the process, noble 1 is weaker than all of his friends (2 and 3), and is thus killed. No other noble is vulnerable in round 1. In round 2, noble 3 is weaker than his only friend, noble 4, and is therefore killed. At this point, the process ends, and the answer is 2.
  
  <image>
  
  In the second type 3 query, the only surviving noble is 4.
  
  The second example consists of only one type 3 query. In the first round, two nobles are killed, and in the second round, one noble is killed. The final answer is 1, since only one noble survives.
  
  <image>
solution: import java.util.ArrayList;
  import java.util.HashSet;
  import java.util.TreeSet;
  import java.io.BufferedReader;
  import java.io.FileReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.StringTokenizer;
  import java.util.Arrays;
  import java.util.Random;
  import java.io.FileWriter;
  import java.io.PrintWriter;
  /*
      Solution Created: 19:18:07 01/08/2021
      Custom Competitive programming helper.
  */
  
  public class Main {
  	static TreeSet<Integer> adj[];
  	static HashSet<Integer> vis;
  	static HashSet<Integer> alive = new HashSet<>();
  	public static void solve() {
  		int n = in.nextInt(), m = in.nextInt();
  		adj = new TreeSet[n];
  		for(int i = 0; i<n; i++) {
  			adj[i] = new TreeSet<>();
  			alive.add(i);
  		}
  		for(int i = 0; i<m; i++) {
  			int a = in.nextInt(), b = in.nextInt();
  			join(a-1, b-1);
  		}
  		int q = in.nextInt();
  		while(q-->0) {
  			int op = in.nextInt();
  			if(op==1) {
  				int a = in.nextInt(), b = in.nextInt();
  				join(a-1, b-1);
  				continue;
  			}
  			if(op==2) {
  				int a = in.nextInt(), b = in.nextInt();
  				unjoin(a-1, b-1);
  				continue;
  			}
  			out.println(alive.size());
  		}
  	}
  	public static void join(int i, int j) {
  		adj[i].add(j);
  		adj[j].add(i);
  		if((!adj[i].isEmpty()) && adj[i].last()>i) alive.remove(i);
  		else alive.add(i);
  		if((!adj[j].isEmpty()) && adj[j].last()>j) alive.remove(j);
  		else alive.add(j);
  	}
  	public static void unjoin(int i, int j) {
  		adj[i].remove(j);
  		adj[j].remove(i);
  		if((!adj[i].isEmpty()) && adj[i].last()>i) alive.remove(i);
  		else alive.add(i);
  		if((!adj[j].isEmpty()) && adj[j].last()>j) alive.remove(j);
  		else alive.add(j);
  	}
  	public static void main(String[] args) {
  		in = new Reader();
  		out = new Writer();
  		int t = 1;
  		while(t-->0) solve();
  		out.exit();
  	}
  	static Reader in; static Writer out;
  
  static class Reader {
  	static BufferedReader br;
  	static StringTokenizer st;
  	
  	public Reader() {
  		this.br = new BufferedReader(new InputStreamReader(System.in));
  	}
  	
  	public Reader(String f){
  		try {
  			this.br = new BufferedReader(new FileReader(f));
  		} catch (IOException e) {
  			e.printStackTrace();
  		}
  	}
  	
  	public int[] na(int n) {
  		int[] a = new int[n];
  		for (int i = 0; i < n; i++) a[i] = nextInt();
  		return a;
  	}
  
  	public double[] nd(int n) {
  		double[] a = new double[n];
  		for (int i = 0; i < n; i++) a[i] = nextDouble();
  		return a;
  	}
  	
  	public long[] nl(int n) {
  		long[] a = new long[n];
  		for (int i = 0; i < n; i++) a[i] = nextLong();
  		return a;
  	}
  
  	public char[] nca() {
  		return next().toCharArray();
  	}
  
  	public String[] ns(int n) {
  		String[] a = new String[n];
  		for (int i = 0; i < n; i++) a[i] = next();
  		return a;
  	}
  
  	public int nextInt() {
  		ensureNext();
  		return Integer.parseInt(st.nextToken());
  	}
  
  	public double nextDouble() {
  		ensureNext();
  		return Double.parseDouble(st.nextToken());
  	}
  
  	public Long nextLong() {
  		ensureNext();
  		return Long.parseLong(st.nextToken());
  	}
  
  	public String next() {
  		ensureNext();
  		return st.nextToken();
  	}
  	
  	public String nextLine() {
  		try {
  			return br.readLine();
  		} catch (Exception e) {
  			e.printStackTrace();
  			return null;
  		}
  	}
  	
  	private void ensureNext() {
  		if (st == null || !st.hasMoreTokens()) {
  			try {
  				st = new StringTokenizer(br.readLine());
  			} catch (IOException e) {
  				e.printStackTrace();
  			}
  		}
  	}
  }
  
  static class Util{
  		private static Random random = new Random();
  		static long[] fact;
  		
  		public static void initFactorial(int n, long mod) {
  			fact = new long[n+1];
  			fact[0] = 1;
  			for (int i = 1; i < n+1; i++) fact[i] = (fact[i - 1] * i) % mod;
  		}
  		
  		public static long modInverse(long a, long MOD) {
  			long[] gcdE = gcdExtended(a, MOD);
  			if (gcdE[0] != 1) return -1; // Inverted doesn't exist
  			long x = gcdE[1];
  			return (x % MOD + MOD) % MOD;
  		}
  		
  		public static long[] gcdExtended(long p, long q) {
  			if (q == 0) return new long[] { p, 1, 0 };
  			long[] vals = gcdExtended(q, p % q);
  			long tmp = vals[2];
  			vals[2] = vals[1] - (p / q) * vals[2];
  			vals[1] = tmp;
  			return vals;
  		}
  		
  		public static long nCr(int n, int r, long MOD) {
  			if (r == 0) return 1;
  			return (fact[n] * modInverse(fact[r], MOD) % MOD * modInverse(fact[n - r], MOD) % MOD) % MOD;
  		}
  		
  		public static long nCr(int n, int r) {
  			return (fact[n]/fact[r])/fact[n-r];
  		}
  		
  		public static long nPr(int n, int r, long MOD) {
  			if (r == 0) return 1;
  			return (fact[n] * modInverse(fact[n - r], MOD) % MOD) % MOD;
  		}
  		public static long nPr(int n, int r) {
  			return fact[n]/fact[n-r];
  		}
  		
  		public static boolean isPrime(int n) { 
  	        if (n <= 1) return false; 
  	        if (n <= 3) return true; 
  	        if (n % 2 == 0 || n % 3 == 0) return false; 
  	        for (int i = 5; i * i <= n; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	            return false; 
  	        return true; 
  	    }
  		
  	    public static boolean[] getSieve(int n) {
  	        boolean[] isPrime = new boolean[n+1];
  	        for (int i = 2; i <= n; i++) isPrime[i] = true;
  	        for (int i = 2; i*i <= n; i++) if (isPrime[i]) 
  	                for (int j = i; i*j <= n; j++) isPrime[i*j] = false;
  	        return isPrime;
  	    }
  	    
  	    public static int gcd(int a, int b) { 
  	    	int tmp = 0;
  	    	while(b != 0) {
  	    		tmp = b;
  	    		b = a%b;
  	    		a = tmp;
  	    	}
  	    	return a;
  	    }
  	    
  	    public static long gcd(long a, long b) { 
  	    	long tmp = 0;
  	    	while(b != 0) {
  	    		tmp = b;
  	    		b = a%b;
  	    		a = tmp;
  	    	}
  	    	return a;
  	    }
  	    
  	    public static int random(int min, int max) {
  	    	return random.nextInt(max-min+1)+min;
  	    }
  	    
  		public static void dbg(Object... o) { 
  			System.out.println(Arrays.deepToString(o)); 
  		}
  		
  		public static void reverse(int[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				int tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static void reverse(int[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static void reverse(long[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				long tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static void reverse(long[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static void reverse(float[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				float tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static void reverse(float[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static void reverse(double[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				double tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static void reverse(double[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static void reverse(char[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				char tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static void reverse(char[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static <T> void reverse(T[] s, int l , int r) {
  			for(int i = l; i<=(l+r)/2; i++) {
  				T tmp = s[i];
  				s[i] = s[r+l-i];
  				s[r+l-i] = tmp;
  			}
  	    }
  		
  		public static <T> void reverse(T[] s) {
  			reverse(s, 0, s.length-1);
  	    }
  		
  		public static void shuffle(int[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            int t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  		
  	    public static void shuffle(long[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            long t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  	    
  	    public static void shuffle(float[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            float t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  	    
  	    public static void shuffle(double[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            double t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  	    
  	    public static void shuffle(char[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            char t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  	    
  	    public static <T> void shuffle(T[] s) {
  	        for (int i = 0; i < s.length; ++i) {
  	            int j = random.nextInt(i + 1);
  	            T t = s[i];
  	            s[i] = s[j];
  	            s[j] = t;
  	        }
  	    }
  	    
  		public static void sortArray(int[] a) {
  	        shuffle(a);
  	        Arrays.sort(a);
  	    }
  		
  		public static void sortArray(long[] a) {
  			shuffle(a);
  	        Arrays.sort(a);
  	    }
  		
  		public static void sortArray(float[] a) {
  			shuffle(a);
  	        Arrays.sort(a);
  	    }
  		
  		public static void sortArray(double[] a) {
  			shuffle(a);
  	        Arrays.sort(a);
  	    }
  		
  		public static void sortArray(char[] a) {
  			shuffle(a);
  	        Arrays.sort(a);
  	    }
  		
  		public static <T extends Comparable<T>> void sortArray(T[] a) {
  	        Arrays.sort(a);
  	    }
  	}
  
  static class Writer {
  	private PrintWriter pw;
  	public Writer(){
  		pw = new PrintWriter(System.out);
  	}
  	
  	public Writer(String f){
  		try {
  			pw = new PrintWriter(new FileWriter(f));
  		} catch (IOException e) {
  			e.printStackTrace();
  		}
  	}
  	
  	public void yesNo(boolean condition) {
  		println(condition?"YES":"NO");
  	}
  	
  	public void printArray(int[] a) {
  		for(int i = 0; i<a.length; i++) print(a[i]+" ");
  	}
  	
  	public void printlnArray(int[] a) {
  		for(int i = 0; i<a.length; i++) print(a[i]+" ");
  		pw.println();
  	}
  	
  	public void printArray(long[] a) {
  		for(int i = 0; i<a.length; i++) print(a[i]+" ");
  	}
  	
  	public void printlnArray(long[] a) {
  		for(int i = 0; i<a.length; i++) print(a[i]+" ");
  		pw.println();
  	}
  	
  	public void print(Object o) {
  		pw.print(o.toString());
  	}
  	
  	public void println(Object o) {
  		pw.println(o.toString());
  	}
  	
  	public void println() {
  		pw.println();
  	}
  	
  	public void flush() {
  		pw.flush();
  	}
  	public void exit() {
  		pw.close();
  	}
  }
  }
  