#include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<cstdlib>

 #include<cstring>

 #include<algorithm>

 #include<vector>

 #include<queue>

 #define inf 2139062143

 #define ll long long

 #define MAXN 400100

 #define V1 (g1.to[i])

 #define V2 (g2.to[i])

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(!isdigit(ch)) {if(ch=='-') f=-;ch=getchar();}

     while(isdigit(ch)) {x=x*+ch-'';ch=getchar();}

     return x*f;

 }

 int n,m;

 int dfn[MAXN],st[MAXN],low[MAXN],top,stp;

 int f[MAXN][],dep[MAXN],dis[MAXN];

 struct graph

 {

     int fst[MAXN],nxt[MAXN<<],to[MAXN<<],cnt;

     void mem(){memset(fst,,sizeof(fst));cnt=;}

     void add(int u,int v) {nxt[++cnt]=fst[u],fst[u]=cnt,to[cnt]=v;}

 }g1,g2;

 void tarjan(int x)

 {

     dfn[x]=low[x]=++stp,st[++top]=x;int now=;

     for(int i=g1.fst[x];i;i=g1.nxt[i])

         if(!dfn[V1])

         {

             tarjan(V1);low[x]=min(low[x],low[V1]);

             if(low[V1]<dfn[x]) continue;m++;

             do{now=st[top--];g2.add(m,now);}

             while(now!=V1);g2.add(x,m);

         }

         else low[x]=min(low[x],dfn[V1]);

 }

 void dfs(int x)

 {

     dfn[x]=++stp;

     for(int i=;(<<i)<=dep[x];i++) f[x][i]=f[f[x][i-]][i-];

     for(int i=g2.fst[x];i;i=g2.nxt[i])

         {f[V2][]=x,dep[V2]=dep[x]+,dis[V2]=dis[x]+(V2<=n);dfs(V2);}

 }

 int lca(int a,int b)

 {

     if(dep[a]<dep[b]) swap(a,b);

     int t=dep[a]-dep[b];

     for(int i=;i>=;i--) if((<<i)&t) a=f[a][i];

     if(a==b) return a;

     for(int i=;i>=;i--) if(f[a][i]!=f[b][i]) a=f[a][i],b=f[b][i];

     return f[a][];

 }

 bool cmp(const int &a,const int &b) {return dfn[a]<dfn[b];}

 inline int calc(int a,int b) {return dis[a]+dis[b]-(dis[lca(a,b)]<<);}

 int main()

 {

     int T=read(),a,b,k,q,res;

     while(T--)

     {

         g1.mem();g2.mem();memset(dfn,,sizeof(dfn));

         memset(f,,sizeof(f));

         n=read(),m=read(),stp=top=;

         while(m--) {a=read(),b=read();g1.add(a,b);g1.add(b,a);}

         m=n;tarjan();dis[]=dep[]=,stp=;dfs();

         q=read();

         while(q--)

         {

             k=read(),top=,res=;

             while(k--) st[++top]=read();

             sort(st+,st+top+,cmp);

             for(int i=;i<=top;i++)

                 res+=calc(st[i],st[i%top+]);

             if(lca(st[],st[top])<=n) printf("%d\n",(res+-top*)>>);

             else printf("%d\n",(res-top*)>>);

         }

     }

 }