#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = a; i < b; i++)

bool is_prime(int n) {
  for (int d = 2; d * d <= n; d++)
    if (n % d == 0)
      return false;
  return true;
}

int modpow(int a, int e, int p) {
  int r = 1;
  while (e) {
    if (e & 1)
      r = (long long)r * a % p;
    a = (long long)a * a % p;
    e >>= 1;
  }
  return r;
}

int find_proot(int p) {
  vector<int> ex;
  for (int i = 2; i < p - 1; i++) {
    if ((p - 1) % i == 0 && is_prime(i))
      ex.push_back((p - 1) / i);
  }
  for (int g = 2; g < p; g++) {
    bool ok = true;
    for (auto e : ex) {
      if (modpow(g, e, p) == 1) {
        ok = false;
        break;
      }
    }
    if (ok)
      return g;
  }
  return -1;
}

int main() {

  int n, m, k;
  cin >> n >> m >> k;

  int p = n + 1;
  while (!is_prime(p))
    p += n;

  const int g = find_proot(p);

  vector<int> mlog(p), mexp(p - 1);
  mlog[0] = -1;
  {
    int w = 1;
    rep(i, 0, p - 1) {
      mlog[w] = i;
      mexp[i] = w;
      w = (long long)w * g % p;
    }
  }

  vector<int> Ks(1);
  rep(i, 0, n) Ks.push_back(mexp[(p-1)/n*i]);
  rep(i, 0, m) {
    int a, b, c;
    cin >> a >> b >> c;
    int r = (Ks[a] + Ks[c] - Ks[b] + p) % p;
    Ks.push_back(r);
  }

  rep(qs, 0, k) {
    int r;
    cin >> r;
    vector<int> ords;
    int sum = 0;
    rep(i, 0, r) {
      int x;
      cin >> x;
      ords.push_back(Ks[x]);
      sum = (sum + Ks[x]) % p;
    }
    if (set(ords.begin(), ords.end()).size() == 1) {
      cout << "Yes\n";
      continue;
    }
    // b*r
    const int b = (long long)sum * modpow(r, p - 2, p) % p;
    bool ok = true;
    for (auto& e : ords) {
      e = (e + p - b) % p;
      if (e == 0) {
        ok = false;
        break;
      }
      e = mlog[e];
    }
    if (!ok) {
      cout << "No\n";
      continue;
    }
    sort(ords.begin(), ords.end());
    set<int> diff;
    rep(i, 0, r) {
      diff.insert((ords[(i + 1) % r] - ords[i] + (p - 1)) % (p - 1));
    }
    cout << (diff.size() == 1 ? "Yes" : "No") << "\n";
  }

  return 0;
}