#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int S = sqrt(N);


vector < pair < int, int > > a;
vector < int > g[N];
int n, m, q, pr[N];
bool us[N], can[N];

void dfs(int x){
    us[x] = 1;
    for (int i = 0; i < g[x].size(); ++i){
        int y = g[x][i];
        if (can[y] && !us[y])dfs(y);
    }
}

int get(int x){
    return pr[x] == x ? x : pr[x] = get(pr[x]);
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    srand(time(NULL));
    cin >>n>>m>>q;
    for (int i = 1; i <= n; ++i)pr[i] = i;
    for (int i = 1; i <= m; ++i){
        int x, y;
        cin >>x>>y;
        g[x].push_back(y);
        g[y].push_back(x);
        a.push_back(make_pair(x, y));
        a.push_back(make_pair(y, x));
    }
    sort(a.begin(), a.end());
    for (int i = 1; i <= q; ++i){
        int k;
        cin >>k;
        vector < int > b(k, 0);
        for (int j = 0; j < k; ++j){
            cin >>b[j];
        }
        if (k > S){
            for (int j = 1; j <= n; ++j)can[j] = us[j] = 0;
            for (int j = 0; j < k; ++j)can[b[j]] = 1;
            int ans = 0;
            for (int j = 0; j < k; ++j){
                int x = b[j];
                if (!us[x]){
                    ans++;
                    dfs(x);
                }
            }
            cout <<ans<<'\n';
        }else {
            for (int j = 0; j < k; ++j){
                int x = b[j];
                for (int l = j + 1; l < k; ++l){
                    int y = b[l];
                    int pos = lower_bound(a.begin(), a.end(), make_pair(x, y)) - a.begin();
                    if (pos < a.size() && a[pos] == make_pair(x, y)){
                        //if (rand() & 1)swap(x, y);
                        pr[get(x)] = get(y);
                    }
                }
            }
            int ans = 0;
            for (int j = 0; j < k; ++j){
                if (get(b[j]) == b[j])ans++;
            }
            for (int j = 0; j < k; ++j)pr[b[j]] = b[j];
            cout <<ans<<'\n';
        }
    }
}