#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T lcm(T a, T b) {
  a = abs(a);
  b = abs(b);
  return (a / gcd(a, b)) * b;
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
inline long long getnum() {
  char c = getchar();
  long long num, sign = 1;
  for (; c < '0' || c > '9'; c = getchar())
    if (c == '-') sign = -1;
  for (num = 0; c >= '0' && c <= '9';) {
    c -= '0';
    num = num * 10 + c;
    c = getchar();
  }
  return num * sign;
}
inline long long power(long long a, long long b) {
  long long multiply = 1;
  for (int i = (0); i < (b); i++) {
    multiply *= a;
  }
  return multiply;
}
char t[2];
int n, m, q, lighton[50002];
bool online[50002];
vector<int> heavy[50002], graph[50002];
int lim;
map<int, int> all[50002];
void add(int u, int v) {
  graph[u].push_back(v);
  all[u][v] = (int)graph[u].size() - 1;
  if (graph[u].size() <= lim) {
    if (online[u]) {
      lighton[v]++;
    }
  }
  if (graph[u].size() == lim) {
    for (auto w : graph[u]) {
      if (w > 0) {
        if (online[u]) lighton[w]--;
        heavy[w].push_back(u);
      } else {
        heavy[-w].push_back(-u);
      }
    }
  }
  if (graph[u].size() > lim) {
    heavy[v].push_back(u);
  }
}
void alter(int u, int v) {
  int idx = all[u][v];
  graph[u][idx] *= -1;
  if (graph[u].size() < lim) {
    if (online[u]) {
      if (graph[u][idx] < 0)
        lighton[v]--;
      else
        lighton[v]++;
    }
  } else {
    for (auto &w : heavy[v]) {
      if (w == -u) {
        w = u;
        return;
      } else if (w == u) {
        w = -u;
        return;
      }
    }
  }
}
int main() {
  int test, cases = 1;
  scanf("%d%d%d", &n, &m, &q);
  lim = sqrt(n);
  int o, x, u, v;
  scanf("%d", &o);
  for (int i = (1); i < (o + 1); i++) {
    scanf("%d", &x);
    online[x] = true;
  }
  for (int i = (1); i < (m + 1); i++) {
    scanf("%d%d", &u, &v);
    add(u, v);
    add(v, u);
  }
  while (q--) {
    scanf("%s %d", t, &u);
    if (strcmp(t, "O") == 0) {
      online[u] = true;
      if (graph[u].size() < lim) {
        for (auto w : graph[u]) {
          if (w > 0) lighton[w]++;
        }
      }
    } else if (strcmp(t, "F") == 0) {
      online[u] = false;
      if (graph[u].size() < lim) {
        for (auto w : graph[u]) {
          if (w > 0) lighton[w]--;
        }
      }
    } else if (strcmp(t, "A") == 0) {
      scanf("%d", &v);
      if (all[u].count(v) == 0)
        add(u, v), add(v, u);
      else
        alter(u, v), alter(v, u);
    } else if (strcmp(t, "D") == 0) {
      scanf("%d", &v);
      alter(u, v), alter(v, u);
    } else if (strcmp(t, "C") == 0) {
      int ans = lighton[u];
      for (auto w : heavy[u]) {
        if (w > 0) ans += online[w];
      }
      printf("%d\n", ans);
    }
  }
  return 0;
}
