#include <iostream>
#include <cstdio>
#include <vector>
#include <unordered_map>
#include <string>
#include <ctime>

using namespace std;

vector<pair<int, int>> pred;

int get_up(int u) {
    if (u == pred[u].first) {
        return u;
    }
    return pred[u].first = get_up(pred[u].first);
}

void Union(int u, int v) {
    u = get_up(u);
    v = get_up(v);
    if (u == v) {
        return;
    }
    if (pred[u].second > pred[v].second) {
        pred[v].first = u;
        pred[u].second += pred[v].second;
    } else {
        pred[u].first = v;
        pred[v].second += pred[u].second;
    }
}

bool check(int u, int v) {
    u = get_up(u);
    v = get_up(v);
    return u == v;
}

int main() {
    unsigned int start = clock();
    vector<int> ansd;
    freopen("30", "r", stdin);
    int n, m, k;
    cin >> n >> m >> k;
    pred.resize(n + 1);
    for (int i = 1; i <= n; ++i) {
        pred[i].first = i;
        pred[i].second = 1;
    }
    vector<unordered_map<int, int>> g(n + 1);
    for (int i = 0; i < m; ++i) {
        int x, y;
        cin >> x >> y;
        g[x][y] = 1;
        g[y][x] = 1;
    }
    for (int i = 0; i < k; ++i) {
        int x, y;
        cin >> x >> y;
        Union(x, y);
    }
    vector<int> ans(n + 1, 0);
    for (int i = 1; i <= n; ++i) {
        vector<int> del;
        for (auto next : g[i]) {
            if (check(next.first, i)) {
                del.push_back(next.first);
                ans[i]++;
            }
        }
        for (int l = 0; l < del.size(); ++l) {
            g[i].erase(del[l]);
        }
    }
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        char c;
        cin >> c;
        if (c == '?') {
            int x;
            cin >> x;
            ansd.push_back(ans[x]);
        } else {
            int x, y;
            cin >> x >> y;
            if (c == 'F') {

            } else {
                if (!check(x, y)) {
                    if (pred[x].second > pred[y].second) {

                    }
                    Union(x, y);
                }
            }
        }
    }
    freopen("30.a", "r", stdin);
    for (int i = 0; i < ansd.size(); ++i) {
        int x;
        cin >> x;
        if (x != ansd[i]) {
            cout << "NO";
        }
    }
    cout << (clock() - start) / 1000.0;
    return 0;
}