#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int totalBridges = 0;
int totalComponents = 0;
vector<int> low;
vector<int> dfs_num;
vector<int> parent;
int N, M;
vector<int> graf[int(1e5)+10];
vector<bool> articulation_map;
vector<int> ap;
vector<pair<int,int>> bridges;
void articulation_points(int u){
    static int dfs_num_cnt = 0;
    low[u] = dfs_num[u] = ++dfs_num_cnt;
    int children = 0;
    for(int i=0;i<graf[u].size();i++) {
        int v = graf[u][i];
        if (dfs_num[v] == -1) {
            parent[v] = u;
            children++;
            articulation_points(v);
            low[u] = min(low[u], low[v]);
            if (parent[u] == -1 && children > 1) {
                articulation_map[u] = true;
            } else if (parent[u] != -1 && low[v] >= dfs_num[u]) {
                articulation_map[u] = true;
            }
            if (low[v] > dfs_num[u]) {
                bridges.push_back({u, v});
            }
        } else if (v != parent[u]) {
            low[u] = min(low[u], dfs_num[v]);
        }
    }
}
void bridg_find(){
    for(int i=0;i<M;i++){
        int a, b;
        a--,b--;
        cin >> a >> b;
        graf[a].push_back(b);
        graf[b].push_back(a);
    }
    low.assign(N,-1);
    dfs_num.assign(N,-1);
    parent.assign(N, -1);
    articulation_map.assign(N, false);
    for(int i = 0;i<N;i++){
        if(dfs_num[i] == -1){
            articulation_points(i);
            totalComponents++;
        }
    }
    for(int i=0;i<N;i++){
        if(articulation_map[i]){
            ap.push_back(i);
            totalBridges++;
        }
    }
}
int Q;

int main() {
    cin >> N >> M;
    cin >> Q;
    bridg_find();
    for(int i=0;i<Q;i++){
        int c;
        cin >> c;
        int sum = 0;
        for(int k=0;k<c;k++){
            int j;
            cin >> j;
            if(articulation_map[j]){
                sum++;
            }
        }
        cout << totalComponents - sum << endl;
        sum = 0;
    }
    return 0;
}