#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #include<cstdlib>

 #define rep(i,l,r) for (int i=l; i<=r; i++)

 #define For(i,x) for (int i=h[x],k; i; i=nxt[i])

 typedef long long ll;

 using namespace std;

 const int N=,M=,SS=;

 int n,m,Q,cnt=,u,v,x,k,ans,h[N],nxt[M],to[M],val[N],fa[N],a[];

 bool vis[N],use[M];

 struct E{ int x,y,v; }e[M];

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

 void dfs(int x,int f){

     vis[x]=;

     For(i,x) if ((k=to[i])!=f && !vis[k]) use[i>>]=,fa[k]=x,dfs(k,x);

 }

 void dfs2(int x){

     For(i,x) if (fa[k=to[i]]==x)

         dfs2(k),e[i>>].v^=val[k],val[x]^=val[k];

 }

 int main(){

     freopen("bzoj3569.in","r",stdin);

     freopen("bzoj3569.out","w",stdout);

     scanf("%d%d",&n,&m); srand();

     rep(i,,m) scanf("%d%d",&e[i].x,&e[i].y),add(e[i].x,e[i].y),add(e[i].y,e[i].x);

     dfs(,);

     rep(i,,m) if (!use[i]) x=rand()%SS+,e[i].v=x,val[e[i].x]^=x,val[e[i].y]^=x;

     dfs2(); scanf("%d",&Q);

     while (Q--){

         scanf("%d",&k); memset(a,,sizeof(a)); bool f=;

         rep(i,,k){

             scanf("%d",&x); x^=ans; x=e[x].v;

             for (int j=; ~j; j--){

                 if (!((x>>j)&)) continue;

                 if (!a[j]) { a[j]=x; break; }

                 x^=a[j];

             }

             if (!x) f=;

         }

         if (!f) puts("Disconnected"); else puts("Connected"),ans++;

     }

     return ;

 }