// bzoj3569#include<algorithm>#include<iostream>#include<cstdlib>#include<cstring>#include<cstdio>#include<cmath>#define LL long long#define inf 2147483640#define Pi acos(-1.0)#define free(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);using namespace std;const int maxn=500010;int fa[maxn],fe[maxn],head[maxn],c[maxn],cnt,n,m,Q;struct data {int u,v,w,tp;}d[maxn];struct edge {int to,next,w;}e[maxn];int find(int x) {	return fa[x]==x ? x : fa[x]=find(fa[x]);}void link(int u,int v,int w) {	e[++cnt]=(edge){v,head[u],w};head[u]=cnt;	e[++cnt]=(edge){u,head[v],w};head[v]=cnt;}void dfs(int x,int fa) {	for (int i=head[x];i;i=e[i].next) if (e[i].to!=fa) {			fe[e[i].to]=e[i].w;			dfs(e[i].to,x);		}}int Dfs(int x,int fa) {	int tmp=0;	for (int i=head[x];i;i=e[i].next) if (e[i].to!=fa) {			d[e[i].w].w^=Dfs(e[i].to,x);			tmp^=d[e[i].w].w;		}	return tmp;}int Gauss(int p) {	for (int now=0,i=1<<30;i;i>>=1) {		int k=now+1;		while (!(c[k]&i) && k<=p) k++;		if (k==p+1) continue;		swap(c[++now],c[k]);		for (int j=1;j<=p;j++) if (j!=now && c[j]&i) c[j]^=c[now];	}	return c[p] ? 1 : 0;}int main() {	srand(987532631);	scanf("%d%d",&n,&m);	for (int i=1;i<=n;i++) fa[i]=i;	for (int i=1;i<=m;i++) {		scanf("%d%d",&d[i].u,&d[i].v);		if (find(d[i].u)!=find(d[i].v)) {			fa[find(d[i].u)]=find(d[i].v),d[i].tp=1;			link(d[i].u,d[i].v,i);		}	}	dfs(1,0);	for (int i=1;i<=m;i++) if (!d[i].tp) {			d[i].w=rand();			d[fe[d[i].u]].w^=d[i].w;			d[fe[d[i].v]].w^=d[i].w;		}	Dfs(1,0);	scanf("%d",&Q);	for (int ans=0,i=1,k;i<=Q;i++) {		scanf("%d",&k);		for (int j=1;j<=k;j++) scanf("%d",&c[j]),c[j]^=ans;		for (int j=1;j<=k;j++) c[j]=d[c[j]].w;		int pd=Gauss(k);		ans+=pd;		puts(pd ? "Connected" : "Disconnected");	}	return 0;}