#include<cstdio>

 #include<cstring>

 #include<algorithm>

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

 typedef long long ll;

 using namespace std;

 const int N=,M=;

 struct P{ int u,v,tim; }e[N];

 struct Q{ int c[],cnt; }q[N];

 int top,n,m,T,tim,u,v,f[N],ans[N],stk1[M],stk2[M];

 int find(int x){

     if (f[x]==x) return x;

     int y=find(f[x]);

     if (y!=f[x]) stk1[++top]=x,stk2[top]=f[x],f[x]=y;

     return y;

 }

 void solve(int l,int r){

     int Top=top;

     if (l==r){

         int flag=;

         rep(i,,q[l].cnt)

             if (find(e[q[l].c[i]].u)!=find(e[q[l].c[i]].v))

                 { flag=; break; }

         ans[l]=flag;

         while (top!=Top) f[stk1[top]]=stk2[top],top--;

         return;

     }

     int mid=(l+r)>>; tim++;

     rep(i,l,mid) rep(j,,q[i].cnt) e[q[i].c[j]].tim=tim;

     rep(i,mid+,r) rep(j,,q[i].cnt){

         int x=q[i].c[j];

         if (e[x].tim!=tim){

             int u=find(e[x].u),v=find(e[x].v);

             if (u!=v) stk1[++top]=u,stk2[top]=f[u],f[u]=v;

         }

     }

     solve(l,mid); tim++;

     while (top!=Top) f[stk1[top]]=stk2[top],top--;

     rep(i,mid+,r) rep(j,,q[i].cnt) e[q[i].c[j]].tim=tim;

     rep(i,l,mid) rep(j,,q[i].cnt){

         int x=q[i].c[j];

         if (e[x].tim!=tim){

             int u=find(e[x].u),v=find(e[x].v);

             if (u!=v) stk1[++top]=u,stk2[top]=f[u],f[u]=v;

         }

     }

     solve(mid+,r);

 }

 int main(){

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

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

     scanf("%d%d",&n,&m); tim=;

     rep(i,,m) scanf("%d%d",&e[i].u,&e[i].v);

     scanf("%d",&T);

     rep(i,,T){

         scanf("%d",&q[i].cnt); int x;

         rep(j,,q[i].cnt) scanf("%d",&x),q[i].c[j]=x,e[x].tim=tim;

     }

     rep(i,,n) f[i]=i;

     rep(i,,m) if (e[i].tim!=tim){

         int u=find(e[i].u),v=find(e[i].v);

         if (u!=v) f[u]=v;

     }

     solve(,T);

     rep(i,,T) if (ans[i]) puts("Connected"); else puts("Disconnected");

     return ;

 }