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

vector<int> v[510];
int color[510], vis[510];

bool dfs(int x)
{
    vis[x] = true;
    for (auto c : v[x])
    {
        if (color[c] == color[x]) return false;
        if (!vis[c]) dfs(c);
    }
    return true;
}

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    while (m--)
    {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    cin >> m;
    while (m--)
    {
        memset(vis, 0, sizeof vis);
        set<int> se;
        for (int i = 1; i <= n; i++) cin >> color[i], se.insert(color[i]);
        bool f = true;
        for (int i = 1; i < n; i++)
        {
            f = dfs(i);
            if (!f) break;
        }
        if (f && se.size() == k) puts("Yes");
        else puts("No");
    }

    return 0;
}