#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pll pair<ll, ll>
#define INF (1ll << 60)
#define ppl pair<pll, pll>
#define vl vector<ll>
#define vvl vector<vl>
#define FOR(i,a,b) for(ll i=a;i<b;++i)
#define pb push_back
#define ALL(X) X.begin(),X.end()
#define endl (char)10
using namespace std;

int find(int x , vector<int> & p){
    if(p[x]!=x){
        p[x] = find(p[x] , p);
    }
    return p[x];
}

bool unioni(int u, int v , vector<int> &p , vector<int> &rank){
    u = find(u,p);
    v = find(v,p);

    if(u==v) return false;

    if(rank[v] < rank[u]){
        p[v] = u;
    }else if(rank[u]<rank[v]){
        p[u]=v;
    }else{
        p[u]=v;
        rank[v]++;
    }
    return true;
}

int main() {
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    int n,e,pr;
    cin>>n>>e>>pr;

    vector<int> rank(n,0);
    vector<int> p(n);

    vector<vector<int>> G(n);

    for(int i=0;i<e;i++){
        int u,v;
        cin>>u>>v;
        u--;v--;

        G[u].push_back(v);
        G[v].push_back(u);
    }

    for(int i=0;i<n;i++){
        p[i]=i;
    }
    
    for(int i=0;i<pr;i++){
        int m;
        cin>>m;
        map<int,bool> mapa;
        vector<int> vs(m);
        int res=0;

        for(int j=0;j<m;j++){
            int k;
            cin>>k;
            k--;
            vs[j]=k;
            mapa[k]=true;
            for(int v : G[k]){
                if(mapa[v]){
                    unioni(k,v,p,rank);
                }
            }
        }


        for(int v:vs){
            // cout << p[v] << v << endl;
            if(p[v]==v){
                res++;
            }
            p[v]=v;
            rank[v]=0;
        }
        cout << res <<endl;
    }
}