#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define ull unsigned long long
#define sort stable_sort 
#define endl '\n'
mt19937_64 rng(random_device{}());
struct node
{
	int nxt,to,id;
}e[1000010];
int head[500010],u[500010],v[500010],vis[500010],ins[500010],cnt=0;
ull w[500010];
void add(int u,int v,int id)
{
	cnt++;  e[cnt]=(node){head[u],v,id};  head[u]=cnt;
}
void dfs(int x,int fa)
{
	vis[x]=ins[x]=1;
	for(int i=head[x];i!=0;i=e[i].nxt)
	{
		if(e[i].id!=fa)
		{
			if(vis[e[i].to]==0)  dfs(e[i].to,e[i].id);
			else  if(ins[e[i].to]==1)  w[e[i].id]=rng();
			w[fa]^=w[e[i].id];
		}
	}
	ins[x]=0;
}
struct Liner_Base
{
	ull d[70];
	void clear()
	{
		memset(d,0,sizeof(d));
	}
	int insert(ull x)
	{
		for(int i=63;i>=0;i--)
		{
			if((x>>i)&1)
			{
				if(d[i]==0)
				{
					d[i]=x;
					return 1;
				}
				x^=d[i];
			}
		}
		return 0;
	}
}L;
int main()
{
// #define Isaac
#ifdef Isaac
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	int n,m,q,k,x,ans=0,flag,i,j;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&u[i],&v[i]);
		add(u[i],v[i],i);  add(v[i],u[i],i);
	}
	dfs(1,0);
	scanf("%d",&q);
	for(i=1;i<=q;i++)
	{
		scanf("%d",&k);  L.clear();
		flag=1;
		for(j=1;j<=k;j++)
		{
			scanf("%d",&x);  x^=ans;
			flag&=L.insert(w[x]);
		}
		ans+=flag;
		if(flag==0)  printf("Disconnected\n");
		else  printf("Connected\n");
	}
	return 0;
}