#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
pair<pair<int, int>, int> p[500500];
vector<pair<int, int> > edge[500500];
int root[500500], can[500500];
int vst[500500], runs, tmp[500500];
int fr(int u) {
  if (vst[u] != runs) tmp[u] = root[u], vst[u] = runs;
  return tmp[u] == u ? u : tmp[u] = fr(tmp[u]);
}
int find_root(int u) { return root[u] == u ? u : root[u] = find_root(root[u]); }
map<int, vector<int> > mp;
int ans[500500];
vector<vector<int> > adj[500500];
int main() {
  int n, m, u, v, w;
  gn(n, m);
  for (int i = 0; i < m; i++) {
    gn(u, v, w);
    p[i] = pair<pair<int, int>, int>(pair<int, int>(u, v), w);
    edge[w].push_back(pair<int, int>(u, v));
  }
  int q;
  gn(q);
  for (int i = 0; i < q; i++) {
    mp.clear();
    int k, id;
    for (gn(k); k--;) {
      gn(id);
      id--;
      mp[p[id].second].push_back(id);
    }
    for (map<int, vector<int> >::iterator it = mp.begin(); it != mp.end();
         it++) {
      adj[it->first].push_back(it->second);
      adj[it->first].back().push_back(i);
    }
    ans[i] = 1;
  }
  for (int i = 1; i <= n; i++) root[i] = i;
  runs++;
  for (int i = 1; i < 500500; i++) {
    for (int j = 0; j < adj[i].size(); j++) {
      int id = adj[i][j].back();
      adj[i][j].pop_back();
      runs++;
      for (int k = 0; k < adj[i][j].size(); k++) {
        u = fr(p[adj[i][j][k]].first.first);
        v = fr(p[adj[i][j][k]].first.second);
        tmp[u] = v;
        if (u == v) {
          ans[id] = 0;
          break;
        }
      }
    }
    for (int j = 0; j < edge[i].size(); j++) {
      u = find_root(edge[i][j].first);
      v = find_root(edge[i][j].second);
      root[u] = v;
    }
  }
  for (int i = 0; i < q; i++) puts(ans[i] ? "YES" : "NO");
  return 0;
}
