#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define rep(i,n) for (int i=0;i<(n);i++)
#define pii pair<int,int> 
#define st first 
#define nd second
#define all(V)  V.begin(), V.end()
const int MAXN=1e5+19;
const int S=400;

vector <pii> E;
int kapitan [MAXN];
int n,e,p;

int fiind (int x)
{
    if(x==kapitan[x])
        return x;
    kapitan[x]=fiind(kapitan[x]);
    return kapitan[x];
}
void unia(int a, int b)
{
    int x=fiind(a);
    int y=fiind(b);
    kapitan[x]=y;
}

void clear(vector<int> &V)
{
     for (int a:V)
        kapitan[a]=a; 
}

void count(vector<int> &V)
{
 set<int> ans;
    for(int a:V)
        ans.insert(fiind(a));
    cout <<ans.size()<<endl;
}

void solve1(vector <int> &V)
{
    for (int a:V)
        for (int b:V)
            if(a<b && binary_search(all(E), make_pair(a,b)))
                unia(a,b);
 
}

void solve2(vector <int> &V)
{
    for (auto p:E)
        if(binary_search(all(V),p.st) && binary_search(all(V),p.nd) )
            unia(p.st,p.nd);
}



void pre()
{
     rep(i,MAXN)
        kapitan[i]=i;
    cin>>n>>e>>p;

    rep(i,e)
    {
        int a,b;
        cin>>a>>b;
        if(a>b)
            swap(a,b);
        E.push_back({a,b});
    } 
    sort(E.begin(),E.end());
}





main()
{
    pre();
    rep(i,p)
    {
        int m;
        cin>>m;
        vector <int> V(m);
        rep(k,m)
            cin>>V[k];
        sort(all(V));
        if(m>S)
            solve2(V);
        else
            solve1(V);
        count(V);
        clear(V);
    }
}