#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <random>
#include <ctime>
#include <chrono>
#include <numeric>
#include <iomanip>
#include <cassert>

typedef long long ll;
typedef double lf;
typedef unsigned long long ull;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 2e5 + 10;

mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count());

int n, m, q, ans[MAXN];
ull hsh[MAXN];
vector <pair <int, int>> e[MAXN];

struct pst
{
    int n; ull hsh;
    vector <int> d;
    bool operator < (const pst &u) const
    {
        if (n ^ u.n) return n < u.n;
        if (hsh ^ u.hsh) return hsh < u.hsh;
        for (int i = 0; i < n; i++)
            if (d[i] ^ u.d[i]) return d[i] < u.d[i];
        return 0;
    }
    bool operator == (const pst &u) const
    {
        if (n ^ u.n) return 0;
        if (hsh ^ u.hsh) return 0;
        for (int i = 0; i < n; i++)
            if (d[i] ^ u.d[i]) return 0;
        return 1;
    }
}a[MAXN];

int cnt[MAXN], idx[MAXN];
bool vis[MAXN], avl[MAXN];
void BFS()
{
    for (int i = 1; i <= n; i++) cnt[i] = 0, vis[i] = 0;
    for (int i = 1; i <= q; i++)
        for (auto x : a[i].d) cnt[x]++;
    queue <int> qu; vector <int> vec, tmp;
    qu.push(1), vis[1] = 1; int g = 0;
    for (int _ = 1; _ <= q + 1; _++)
    {
        while (!qu.empty())
        {
            int u = qu.front(); qu.pop();
            idx[u] = ++g;
            for (auto [v, id] : e[u])
            {
                if (vis[v]) continue;
                if (!cnt[v]) qu.push(v), vis[v] = 1;
                else vec.emplace_back(v);
            }
        }
        if (!vec.size()) continue;
        sort(vec.begin(), vec.end()), vec.resize(unique(vec.begin(), vec.end()) - vec.begin());
        pst cur = {(int)vec.size(), 0, vec};
        for (auto x : vec) cur.hsh ^= hsh[x];
        int pos = lower_bound(a + 1, a + q + 1, cur) - a, pp = pos;
        while (pos <= q && a[pos] == cur) avl[pos++] = 1;
        if (pos == pp) break;
        tmp.clear();
        for (auto x : vec)
            if (!--cnt[x]) qu.push(x), vis[x] = 1;
            else tmp.push_back(x);
        vec.swap(tmp);
    }
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    Read(T);
    while (T--)
    {
        Read(n), Read(m);
        for (int i = 1; i <= n; i++) hsh[i] = Rand(), e[i].clear();
        for (int i = 1, u, v; i <= m; i++) Read(u), Read(v), e[u].emplace_back(v, i), e[v].emplace_back(u, i);
        Read(q);
        bool flag = 0;
        for (int i = 1; i <= q; i++)
        {
            Read(a[i].n);
            a[i].d.resize(a[i].n), a[i].hsh = 0;
            for (int j = 0; j < a[i].n; j++) Read(a[i].d[j]), a[i].hsh ^= hsh[a[i].d[j]];
            sort(a[i].d.begin(), a[i].d.end());
            if (a[i].n == 1 && a[i].d[0] == 1) { i--, q--; continue; }
            if (a[i].d[0] == 1) flag = 1;
        }
        if (flag) { cout << "No\n"; continue; }
        sort(a + 1, a + q + 1);
        for (int i = 1; i <= q; i++) avl[i] = 0;
        BFS();
        for (int i = 1; i <= q; i++) flag |= (avl[i] == 0);
        if (flag) { cout << "No\n"; continue; }
        for (int i = 1; i <= n; i++)
            for (auto [v, id] : e[i])
                ans[id] = abs(idx[i] - idx[v]);
        cout << "Yes\n";
        for (int i = 1; i <= m; i++) cout << ans[i] << ' '; cout << '\n';
    }
    return 0;
}