#include <iostream>
#include <unordered_set>

using namespace std;

const int N = 10010;

int n, m;
int a[N], b[N];

int main()
{
    scanf("%d%d", &n, &m);

    for (int i = 0; i < n; i ++ ) scanf("%d%d", &a[i], &b[i]);

    while (m -- )
    {
        int k;
        scanf("%d", &k);
        unordered_set<int> S;
        while (k -- )
        {
            int x;
            scanf("%d", &x);
            S.insert(x);
        }

        bool success = true;
        for (int i = 0; i < n; i ++ )
            if (S.count(a[i]) && S.count(b[i]))
            {
                success = false;
                break;
            }

        if (success) puts("Yes");
        else puts("No");
    }

    return 0;
}