//#include<iostream>

 #include<cstring>

 #include<cstdlib>

 #include<cstdio>

 #include<vector>

 //#include<queue>

 //#include<time.h>

 //#include<complex>

 #include<algorithm>

 #include<stdlib.h>

 using namespace std;

 int n,m,lq;

 #define maxn 500011

 struct Edge{int from,to,v;}edge[maxn];

 int ufs[maxn],vis[maxn],ufsb[maxn];

 int find(int x) {return ufs[x]==x?x:(ufs[x]=find(ufs[x]));}

 int findb(int Time,int x) {return vis[x]==Time?(ufsb[x]==x?x:(ufsb[x]=findb(Time,ufsb[x]))):(vis[x]=Time,(ufsb[x]=find(x)));}

 bool ans[maxn];

 struct vnode{int id,e;};

 vector<vnode> v[maxn],ve[maxn];

 int main()

 {

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

     for (int i=,x,y,val;i<=m;i++) scanf("%d%d%d",&x,&y,&val),maxv=max(maxv,val),

     edge[i]=(Edge){x,y,val},ve[val].push_back((vnode){x,y});

     scanf("%d",&lq);

     for (int i=,x,y;i<=lq;i++)

     {

         scanf("%d",&x);

         while (x--) scanf("%d",&y),v[edge[y].v].push_back((vnode){i,y});

     }

     for (int i=;i<=n;i++) ufs[i]=i;

     int Time=;

     for (int i=;i<=maxv;i++)

     {

         for (int j=,last=,to=v[i].size();j<to;j++)

         {

             int id=v[i][j].id,x=edge[v[i][j].e].from,y=edge[v[i][j].e].to;

             if (last!=id) ++Time;

             if (vis[x]!=Time) vis[x]=Time,ufsb[x]=find(x);

             if (vis[y]!=Time) vis[y]=Time,ufsb[y]=find(y);

             if (findb(Time,x)==findb(Time,y)) ans[id]=;

             ufsb[ufsb[x]]=ufsb[y];

             last=id;

         }

         for (int j=,to=ve[i].size();j<to;j++)

         {

             int x=find(ve[i][j].id),y=find(ve[i][j].e);

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

         }

     }

     for (int i=;i<=lq;i++) puts(ans[i]?"NO":"YES");

     return ;

 }