#include<bits/stdc++.h>
using namespace std;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,j) rrep2(i,j,0)
#define SZ(a) ll(a.size())
#define eb emplace_back
#define all(a) a.begin(),a.end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
template<class T>
bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T>
bool chmax(T& a,T b){return a<b?a=b,1:0;}

random_device seed_gen;
mt19937_64 mt(seed_gen());
using u64 = uint64_t;
u64 H[200010];

void solve() {
	int n,m;
	cin >> n >> m;
	vvp G(n);
	rep(i, m) {
		int u, v;
		cin >> u >> v;
		--u, --v;
		G[u].eb(v,i);
		G[v].eb(u,i);
	}
	set<u64> st;
	int k;
	cin >> k;
	vl d(n);
	rep(i, k) {
		int b;
		cin >> b;
		u64 now = 0;
		rep(_, b) {
			int x;
			cin >> x;
			--x;
			now ^= H[x];
			++d[x];
		}
		st.insert(now);
	}
	vl dist(n, -1);
	int nx = 0;
	set<int> can, fr;
	if(d[0]) fr.insert(0);
	else can.insert(0);
	vl ans(m, 1000000000);
	while(!can.empty() or !fr.empty()) {
		if(can.empty()) {
			u64 now = 0;
			for(int i : fr) now ^= H[i];
			if(!st.contains(now)) {
				cout << "No\n";
				return;
			}
			st.erase(now);
			auto it = fr.begin();
			while(it != fr.end()) {
				if(--d[*it] == 0) {
					can.insert(*it);
					it = fr.erase(it);
				} else {
					++it;
				}
			}
			continue;
		}
		int u = *can.begin();
		can.erase(can.begin());
		dist[u] = nx++;
		for(auto [v, id] : G[u]) {
			if(dist[v] == -1) {
				if(!can.contains(v) and !fr.contains(v)) {
					if(d[v]) fr.insert(v);
					else can.insert(v);
				}
			} else {
				ans[id] = dist[u]-dist[v];
			}
		}
	}
	assert(st.empty());
	cout << "Yes\n";
	rep(i, m) cout << ans[i] << " \n"[i==m-1];
}

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cout<<fixed<<setprecision(10);
	rep(i, 200010) H[i] = mt();
	int t;
	cin >> t;
	while(t--) solve();
}