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 sys, os, io
  def rs(): return sys.stdin.readline().rstrip()
  def ri(): return int(sys.stdin.readline())
  def ria(): return list(map(int, sys.stdin.readline().split()))
  def ws(s): sys.stdout.write(s + '\n')
  def wi(n): sys.stdout.write(str(n) + '\n')
  def wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
  import math,datetime,functools,itertools,operator,bisect,fractions,statistics
  from collections import deque,defaultdict,OrderedDict,Counter
  from fractions import Fraction
  from decimal import Decimal
  from sys import stdout
  from heapq import heappush, heappop, heapify ,_heapify_max,_heappop_max,nsmallest,nlargest
  # sys.setrecursionlimit(111111) 
  INF=999999999999999999999999
  alphabets="abcdefghijklmnopqrstuvwxyz"
  class SortedList:
      def __init__(self, iterable=[], _load=200):
          """Initialize sorted list instance."""
          values = sorted(iterable)
          self._len = _len = len(values)
          self._load = _load
          self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
          self._list_lens = [len(_list) for _list in _lists]
          self._mins = [_list[0] for _list in _lists]
          self._fen_tree = []
          self._rebuild = True
   
      def _fen_build(self):
          """Build a fenwick tree instance."""
          self._fen_tree[:] = self._list_lens
          _fen_tree = self._fen_tree
          for i in range(len(_fen_tree)):
              if i | i + 1 < len(_fen_tree):
                  _fen_tree[i | i + 1] += _fen_tree[i]
          self._rebuild = False
   
      def _fen_update(self, index, value):
          """Update `fen_tree[index] += value`."""
          if not self._rebuild:
              _fen_tree = self._fen_tree
              while index < len(_fen_tree):
                  _fen_tree[index] += value
                  index |= index + 1
   
      def _fen_query(self, end):
          """Return `sum(_fen_tree[:end])`."""
          if self._rebuild:
              self._fen_build()
   
          _fen_tree = self._fen_tree
          x = 0
          while end:
              x += _fen_tree[end - 1]
              end &= end - 1
          return x
   
      def _fen_findkth(self, k):
          """Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`)."""
          _list_lens = self._list_lens
          if k < _list_lens[0]:
              return 0, k
          if k >= self._len - _list_lens[-1]:
              return len(_list_lens) - 1, k + _list_lens[-1] - self._len
          if self._rebuild:
              self._fen_build()
   
          _fen_tree = self._fen_tree
          idx = -1
          for d in reversed(range(len(_fen_tree).bit_length())):
              right_idx = idx + (1 << d)
              if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
                  idx = right_idx
                  k -= _fen_tree[idx]
          return idx + 1, k
   
      def _delete(self, pos, idx):
          """Delete value at the given `(pos, idx)`."""
          _lists = self._lists
          _mins = self._mins
          _list_lens = self._list_lens
   
          self._len -= 1
          self._fen_update(pos, -1)
          del _lists[pos][idx]
          _list_lens[pos] -= 1
   
          if _list_lens[pos]:
              _mins[pos] = _lists[pos][0]
          else:
              del _lists[pos]
              del _list_lens[pos]
              del _mins[pos]
              self._rebuild = True
   
      def _loc_left(self, value):
          """Return an index pair that corresponds to the first position of `value` in the sorted list."""
          if not self._len:
              return 0, 0
   
          _lists = self._lists
          _mins = self._mins
   
          lo, pos = -1, len(_lists) - 1
          while lo + 1 < pos:
              mi = (lo + pos) >> 1
              if value <= _mins[mi]:
                  pos = mi
              else:
                  lo = mi
   
          if pos and value <= _lists[pos - 1][-1]:
              pos -= 1
   
          _list = _lists[pos]
          lo, idx = -1, len(_list)
          while lo + 1 < idx:
              mi = (lo + idx) >> 1
              if value <= _list[mi]:
                  idx = mi
              else:
                  lo = mi
   
          return pos, idx
   
      def _loc_right(self, value):
          """Return an index pair that corresponds to the last position of `value` in the sorted list."""
          if not self._len:
              return 0, 0
   
          _lists = self._lists
          _mins = self._mins
   
          pos, hi = 0, len(_lists)
          while pos + 1 < hi:
              mi = (pos + hi) >> 1
              if value < _mins[mi]:
                  hi = mi
              else:
                  pos = mi
   
          _list = _lists[pos]
          lo, idx = -1, len(_list)
          while lo + 1 < idx:
              mi = (lo + idx) >> 1
              if value < _list[mi]:
                  idx = mi
              else:
                  lo = mi
   
          return pos, idx
   
      def add(self, value):
          """Add `value` to sorted list."""
          _load = self._load
          _lists = self._lists
          _mins = self._mins
          _list_lens = self._list_lens
   
          self._len += 1
          if _lists:
              pos, idx = self._loc_right(value)
              self._fen_update(pos, 1)
              _list = _lists[pos]
              _list.insert(idx, value)
              _list_lens[pos] += 1
              _mins[pos] = _list[0]
              if _load + _load < len(_list):
                  _lists.insert(pos + 1, _list[_load:])
                  _list_lens.insert(pos + 1, len(_list) - _load)
                  _mins.insert(pos + 1, _list[_load])
                  _list_lens[pos] = _load
                  del _list[_load:]
                  self._rebuild = True
          else:
              _lists.append([value])
              _mins.append(value)
              _list_lens.append(1)
              self._rebuild = True
   
      def discard(self, value):
          """Remove `value` from sorted list if it is a member."""
          _lists = self._lists
          if _lists:
              pos, idx = self._loc_right(value)
              if idx and _lists[pos][idx - 1] == value:
                  self._delete(pos, idx - 1)
   
      def remove(self, value):
          """Remove `value` from sorted list; `value` must be a member."""
          _len = self._len
          self.discard(value)
          if _len == self._len:
              raise ValueError('{0!r} not in list'.format(value))
   
      def pop(self, index=-1):
          """Remove and return value at `index` in sorted list."""
          pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
          value = self._lists[pos][idx]
          self._delete(pos, idx)
          return value
   
      def bisect_left(self, value):
          """Return the first index to insert `value` in the sorted list."""
          pos, idx = self._loc_left(value)
          return self._fen_query(pos) + idx
   
      def bisect_right(self, value):
          """Return the last index to insert `value` in the sorted list."""
          pos, idx = self._loc_right(value)
          return self._fen_query(pos) + idx
   
      def count(self, value):
          """Return number of occurrences of `value` in the sorted list."""
          return self.bisect_right(value) - self.bisect_left(value)
   
      def __len__(self):
          """Return the size of the sorted list."""
          return self._len
   
      def __getitem__(self, index):
          """Lookup value at `index` in sorted list."""
          pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
          return self._lists[pos][idx]
   
      def __delitem__(self, index):
          """Remove value at `index` from sorted list."""
          pos, idx = self._fen_findkth(self._len + index if index < 0 else index)
          self._delete(pos, idx)
   
      def __contains__(self, value):
          """Return true if `value` is an element of the sorted list."""
          _lists = self._lists
          if _lists:
              pos, idx = self._loc_left(value)
              return idx < len(_lists[pos]) and _lists[pos][idx] == value
          return False
   
      def __iter__(self):
          """Return an iterator over the sorted list."""
          return (value for _list in self._lists for value in _list)
   
      def __reversed__(self):
          """Return a reverse iterator over the sorted list."""
          return (value for _list in reversed(self._lists) for value in reversed(_list))
   
      def __repr__(self):
          """Return string representation of sorted list."""
          return 'SortedList({0})'.format(list(self))
      
  class SegTree:
      
      def __init__(self, n):
          self.N = 1 << n.bit_length()
          self.tree = [0] * (self.N<<1)
      
      def update(self, i, j, v):
          i += self.N
          j += self.N
          while i <= j:
              if i%2==1: self.tree[i] += v
              if j%2==0: self.tree[j] += v
              i, j = (i+1) >> 1, (j-1) >> 1
      
      def query(self, i):
          v = 0
          i += self.N
          while i > 0:
              v += self.tree[i]
              i >>= 1
          return v
  
  def SieveOfEratosthenes(limit):
      """Returns all primes not greater than limit."""
      isPrime = [True]*(limit+1)
      isPrime[0] = isPrime[1] = False
      primes = []
      for i in range(2, limit+1):
          if not isPrime[i]:continue
          primes += [i]
          for j in range(i*i, limit+1, i):
              isPrime[j] = False
      return primes
  
  
  def main():
  
      mod=1000000007
      # InverseofNumber(mod)
      # InverseofFactorial(mod)
      # factorial(mod)
      starttime=datetime.datetime.now()
      if(os.path.exists('input.txt')):
          sys.stdin = open("input.txt","r")
          sys.stdout = open("output.txt","w")
                      
      tc = 1
      for _ in range(tc):     
          n,m=ria()
          friends=[[] for i in range(n+1)]
          weaker=[0]*(n+1)
          # LOGIC EDITORIAL or https://www.youtube.com/watch?v=ceoAsc-xWwc
          
          for i in range(m):
              a,b=ria()
              a,b=min(a,b),max(a,b)
              friends[a].append(b)
              friends[b].append(a)
              weaker[a]+=1
          q=ri()
          ans=0
          for i in range(1,n+1):
              if weaker[i]==0:
                  ans+=1
                  
          for i in range(q):
              x=ria()
              if x[0]==3:
                  wi(ans)
              else:
                  a,b=x[1],x[2]
                  a,b=min(a,b),max(a,b)
                  if x[0]==1:
                      if weaker[a]==0:
                          ans-=1
                      weaker[a]+=1
                  else:
                      if weaker[a]==1:
                          ans+=1
                      weaker[a]-=1
          
          
  
                  
          
                              
         
         
          
          
          
                   
              
              
              
  
          
                                      
          
                  
                      
  
          
          
   
                  
          
          
          
          
          
          
  
                      
                  
                  
                  
          
          
          
              
          
                          
              
   
              
  
  
                  
  
          
          
          
          
          
         
          
         
  
          
          
  
              
              
              
                  
              
  
              
              
          
          
             
          
          
                   
                  
          
          
  
          
          
  
          
          
          
              
          
          
              
                  
  
              
              
                  
              
              
              
              
          
          
         
           
          
  
          
          
                      
                          
  
                      
             
                       
              
          
                  
          
          
              
          
          
          
          
          
  
      
          
          
          
                  
                  
          
          
          
      
  
          
          
          
  
          
                               
          
          
          
              
          
          
                       
          
          
                      
          
                       
                      
                      
                  
                  
                      
                  
          
          
              
                     
          
                      
  
          
          
                  
              
              
      
              
                          
          
      
  
          
      #<--Solving Area Ends
      endtime=datetime.datetime.now()
      time=(endtime-starttime).total_seconds()*1000
      if(os.path.exists('input.txt')):
          print("Time:",time,"ms")  
      
                  
  class FastReader(io.IOBase):
      newlines = 0
  
      def __init__(self, fd, chunk_size=1024 * 8):
          self._fd = fd
          self._chunk_size = chunk_size
          self.buffer = io.BytesIO()
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self, size=-1):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
  
  class FastWriter(io.IOBase):
  
      def __init__(self, fd):
          self._fd = fd
          self.buffer = io.BytesIO()
          self.write = self.buffer.write
  
      def flush(self):
          os.write(self._fd, self.buffer.getvalue())
          self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class FastStdin(io.IOBase):
      def __init__(self, fd=0):
          self.buffer = FastReader(fd)
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  class FastStdout(io.IOBase):
      def __init__(self, fd=1):
          self.buffer = FastWriter(fd)
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.flush = self.buffer.flush
  
  
  if __name__ == '__main__':
      sys.stdin = FastStdin()
      sys.stdout = FastStdout()
      main()
      