RT

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN=5e5+5;
ll t,n,m,x,y,q;
ll s,pos[MAXN];
struct edge{
	ll u,v,nxt;
}e[MAXN],tree[MAXN];
ll head[MAXN],edge_num;
void add_edge(ll From,ll To){
	e[++edge_num]=(edge){From,To,head[From]};
	head[From]=edge_num;
	return;
}
ll head_tree[MAXN],edge_tree;
void add_tree(ll From,ll To){
	tree[++edge_tree]=(edge){From,To,head_tree[From]};
	head_tree[From]=edge_tree;
	return;
}
ll dfn[MAXN],low[MAXN],cnt;
ll st[MAXN],top;
ll tot;
void tarjan(ll now,ll father){
	dfn[now]=low[now]=++cnt;
	st[++top]=now;
	for(int i=head[now];i;i=e[i].nxt){
		if(!dfn[e[i].v]){
			tarjan(e[i].v,now);
			low[now]=min(low[e[i].v],low[now]);
			if(low[e[i].v]>=dfn[now]){
				tot++;
				while(st[top+1]!=e[i].v){
					add_tree(st[top],tot);
					add_tree(tot,st[top]);
					top--;
				}
				add_tree(st[top],tot);
				add_tree(tot,st[top]);
			}
		}
		else if(e[i].v!=father)low[now]=min(low[now],dfn[e[i].v]);
	}
	return;
}
ll fa[MAXN][35],dfn_t[MAXN],cnt_t;
ll deep[MAXN],dis[MAXN];
void pre(ll now,ll father){
	fa[now][0]=father;
	deep[now]=deep[father]+1;
	dfn_t[now]=++cnt_t;
	dis[now]=dis[father]+(now<=n);
	for(int i=1;i<=30;i++)fa[now][i]=fa[fa[now][i-1]][i-1];
	for(int i=head_tree[now];i;i=tree[i].nxt){
		if(tree[i].v==father)continue;
		pre(tree[i].v,now);
	} 
	return;
}
bool cmp(ll A,ll B){
	return dfn_t[A]<dfn_t[B];
}
ll lca(ll X,ll Y){
	if(deep[X]<deep[Y])swap(X,Y);
	for(int i=30;i>=0&&deep[X]!=deep[Y];i--)if(deep[fa[X][i]]>=deep[Y])X=fa[X][i];
	if(X==Y)return X;
	for(int i=30;i>=0;i--)if(fa[X][i]!=fa[Y][i])X=fa[X][i],Y=fa[Y][i];
	return fa[X][0];
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>t;
	while(t--){
		cin>>n>>m;
		memset(head,0,sizeof(head));
		memset(head_tree,0,sizeof(head_tree));
		memset(dfn,0,sizeof(dfn));
		memset(low,0,sizeof(low));
		memset(st,0,sizeof(st));
		memset(fa,0,sizeof(fa));
		memset(dfn_t,0,sizeof(dfn_t));
		memset(deep,0,sizeof(deep));
		memset(dis,0,sizeof(dis));
		cnt_t=0;
		cnt=top=tot=0;
		edge_num=edge_tree=0;
		for(int i=1;i<=m;i++){
			cin>>x>>y;
			add_edge(x,y);
			add_edge(y,x);
		} 
		tot=n;
		tarjan(1,0);
		pre(1,1);
		cin>>q;
		for(int i=1;i<=q;i++){
			cin>>s;
			for(int j=1;j<=s;j++)cin>>pos[j];
			sort(pos+1,pos+1+s,cmp);
			pos[s+1]=pos[1];
			ll ans=0;
			for(int j=1;j<=s;j++){
				ll LCA=lca(pos[j],pos[j+1]);
				ans+=dis[pos[j]]+dis[pos[j+1]]-2*dis[LCA];
			}
			ans>>=1;
			ans-=s;
			ans+=(lca(pos[s],pos[1])<=n);
			cout<<ans<<endl;
			for(int j=1;j<=s+1;j++)pos[j]=0;
		}
	}
	return 0;
}