//It is made by ljh2000
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <ctime>
#define lc root<<1
#define rc root<<1|1
#define SS 1000000000
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define reg(i,x) for(int i=first[x];i;i=next[i])
using namespace std;
typedef long long LL;
const int MAXN = 400011;
const int MAXM = 1000011;
int n,m,Q,ecnt,first[MAXN],next[MAXM],to[MAXM],val[MAXN],ans,father[MAXN],a[45];
bool vis[MAXN],use[MAXM];
struct edge{ int x,y,val; }e[MAXM];
inline void link(int x,int y){ next[++ecnt]=first[x]; first[x]=ecnt; to[ecnt]=y; }
inline int getint(){
    int w=0,q=0; char c=getchar(); while((c<‘0‘||c>‘9‘) && c!=‘-‘) c=getchar();
    if(c==‘-‘) q=1,c=getchar(); while (c>=‘0‘&&c<=‘9‘) w=w*10+c-‘0‘,c=getchar(); return q?-w:w;
}

inline void dfs(int x,int fa){
	vis[x]=1;
	for(int i=first[x];i;i=next[i]) {
		int v=to[i]; if(v==fa) continue;
		if(vis[v]) continue;
		use[i>>1]=1; father[v]=x;
		dfs(v,x);
	}
}

inline void dfs2(int x,int fa){
	for(int i=first[x];i;i=next[i]) {
		int v=to[i]; if(father[v]!=x) continue;
		dfs2(v,x);
		e[i>>1].val^=val[v];
		val[x]^=val[v];
	}
}

inline void work(){
	srand(20000605);
	n=getint(); m=getint(); ecnt=1; int x,y,k; bool ok;
	for(int i=1;i<=m;i++) { e[i].x=x=getint(); e[i].y=y=getint(); link(x,y); link(y,x); }
	dfs(1,0);
	for(int i=1;i<=m;i++)
		if(!use[i]) {
			x=rand()%SS+1;
			e[i].val=x;
			val[e[i].x]^=x;
			val[e[i].y]^=x;
		}
	dfs2(1,0);
	Q=getint();
	while(Q--) {
		k=getint(); memset(a,0,sizeof(a));
		ok=true;
		for(int i=1;i<=k;i++) {
			x=getint(); x^=ans; x=e[x].val;
			for(int j=30;j>=0;j--) {
				if(! ((x>>j)&1) ) continue;
				if(!a[j]) { a[j]=x; break; }
				x^=a[j];
			}
			if(x==0) ok=false;
		}
		if(!ok) { puts("Disconnected"); }
		else { puts("Connected"); ans++; }
	}
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("3569.in","r",stdin);
	freopen("3569.out","w",stdout);
#endif
    work();
    return 0;
}
//有志者，事竟成，破釜沉舟，百二秦关终属楚；苦心人，天不负，卧薪尝胆，三千越甲可吞吴。