#include<cstring>

#include<iostream>

#include<algorithm>

#include<cstdio>

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

#define down(i,l,r) for (int i=l;i>=r;i--)

#define clr(x,y) memset(x,y,sizeof(x))

#define maxn 200500

using namespace std;

struct data{int x,y,id,k,b;

}a[][maxn];

int b[maxn][];

int fa[maxn],np[maxn],pos[maxn],n,m,Q;

int read(){

    int x=,f=; char ch=getchar();

    while (!isdigit(ch)) {if (ch=='-') f=-; ch=getchar();}

    while (isdigit(ch)) {x=x*+ch-''; ch=getchar();}

    return x*f;

}

int find(int x){

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

    return fa[x]=find(fa[x]);

}

void cdq(int dep,int l,int r,int n,int m){

    rep(i,,m){

        data &c=a[dep][i],&c2=a[dep-][i];

        c=(data){c2.x,c2.y,c2.id,,};

        pos[c2.id]=i;

    }

    if (l==r){

        rep(i,,b[l][]) a[dep][pos[b[l][i]]].b=;

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

        int cnt=;

        rep(i,,m) if (a[dep][i].b!=) {

            data c=a[dep][i];

            int x=find(c.x),y=find(c.y);

            if (x!=y) fa[x]=y,cnt++;

        }

        if (cnt==n-) puts("Connected");

        else puts("Disconnected");

        return;

    }

    rep(i,l,r) rep(j,,b[i][]) a[dep][pos[b[i][j]]].k=;

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

    rep(i,,m) if (a[dep][i].k==){

        data &c=a[dep][i];

        int x=find(c.x),y=find(c.y);

        if (x!=y) fa[x]=y;

    }

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

    int nn=,nm=;

    rep(i,,n) if (!np[find(i)]) np[find(i)]=++nn;

    rep(i,,m) if (a[dep][i].k) {

        data c=a[dep][i];

        int x=find(c.x),y=find(c.y);

        a[dep][++nm]=(data){np[x],np[y],c.id,c.k,};

    }

    int mid=(l+r)/;

    cdq(dep+,l,mid,nn,nm);

    cdq(dep+,mid+,r,nn,nm);

}

int main(){

    n=read(); m=read();

    int x,y;

    rep(i,,m){

        x=read(); y=read();

        a[][i]=(data){x,y,i,,};

    }

    Q=read();

    rep(i,,Q){

        b[i][]=read();

        rep(j,,b[i][]) b[i][j]=read();

    }

    cdq(,,Q,n,m);

    return ;

}