#include <bits/stdc++.h>
#define int long long
// #pragma GCC optimize(2)
using namespace std;
const int N = 2e5 + 10, MOD = 998244353;

int t;
int n, m, q;
int u, v, k, s[N];
vector <int> e[N], ee[N], g[N];

int dfn[N], low[N], cdfn, cnt;
vector <int> st;

void Tarjan(int x, int y){
    dfn[x] = low[x] = ++cdfn;
    st.push_back(x);

    for(auto i : e[x]){
        if(!dfn[i]){
            Tarjan(i, x);
            low[x] = min(low[x], low[i]);

            if(low[i] == dfn[x]){
                ++cnt;

                int tp = st.back();
                do{
                    tp = st.back();
                    st.pop_back();

                    ee[cnt].push_back(tp);
                    ee[tp].push_back(cnt);
                    // cout << cnt << " " << tp << "\n";
                }while(tp != i);

                ee[cnt].push_back(x);
                ee[x].push_back(cnt);
                // cout << cnt << " " << x << "\n";
            }
        }else{
            low[x] = min(low[x], dfn[i]);
        }
    }
}

int si[N], son[N], top[N], fa[N], dep[N];

void Dfs1(int x, int y){
    si[x] = 1;
    fa[x] = y;
    dep[x] = dep[y] + 1;

    for(auto i : ee[x]){
        if(i == y) continue;
        Dfs1(i, x);

        si[x] += si[i];
        if(si[i] > si[son[x]]) son[x] = i;
    }
}

void Dfs2(int x, int tp){
    top[x] = tp;

    if(son[x]) Dfs2(son[x], tp);
    for(auto i : ee[x]){
        if(top[i]) continue;
        Dfs2(i, i);
    }
}

int Lca(int x, int y){
    while(top[x] != top[y]){
        if(dep[top[x]] < dep[top[y]]){
            swap(x, y);
        }
        x = fa[top[x]];
    }

    if(dep[x] < dep[y]) return x;
    else return y;
}

bool cmp(int x, int y){
    return dfn[x] < dfn[y];
}

int dis[N];
bool tag[N];

void Get_dis(int x, int y){
    dfn[x] = ++cdfn;
    dis[x] = dis[y] + (1 <= x && x <= n);
    for(auto i : ee[x]){
        if(i == y) continue;
        Get_dis(i, x);
    }
}

signed main(){
    // freopen("1.in", "r", stdin);

    cin >> t;
    while(t--){
        cin >> n >> m;
        for(int i = 1; i <= m; i++){
            cin >> u >> v;
            e[u].push_back(v);
            e[v].push_back(u);
        }
        cnt = n;

        Tarjan(1, 0);
        Dfs1(1, 0);
        Dfs2(1, 1);

        cdfn = 0;
        Get_dis(1, 0);

        cin >> q;
        for(int i = 1; i <= q; i++){
            cin >> k;
            for(int j = 1; j <= k; j++){
                cin >> s[j];
                tag[s[j]] = 1;
            }
            sort(s + 1, s + 1 + k, cmp);

            int lim = k;
            for(int j = 2; j <= k; j++){
                int lca = Lca(s[j - 1], s[j]);
                if(lca != s[j - 1] && lca != s[j]) s[++lim] = lca;
            }
            sort(s + 1, s + 1 + lim, cmp);
            lim = unique(s + 1, s + 1 + lim) - s - 1;

            int ans = 0;
            ans += (s[1] == 1 && tag[1] == 0);
            // cout << s[1] << " ";
            for(int j = 2; j <= lim; j++){
                int lca = Lca(s[j - 1], s[j]);
                ans += dis[s[j]] - dis[lca] - tag[s[j]];
                // cout << s[j] << " ";
            }
            cout << ans << "\n";

            for(int j = 1; j <= lim; j++) tag[s[j]] = 0;
        }

        for(int i = 1; i <= cnt; i++){
            e[i].clear();
            ee[i].clear();
            dis[i] = top[i] = fa[i] = son[i] = si[i] = 0;
            dfn[i] = low[i] = 0;
        }
        cdfn = 0;
    }
}