#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int > 
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
using namespace std;
const int N = 2e6 + 7;

mt19937_64 orz(time(0) ^ (*new char));
 
int stk[N], tp, id[N];
ull xw[N];
int f[N], siz[N];
inline int find(int x) { 
    return f[x] == x ? x : find(f[x]); 
}

ull SUM;
inline void revoke() {
    int u = stk[tp];
    siz[f[u]] -= siz[u], SUM ^= xw[f[u]], xw[f[u]] -= xw[u];
	SUM ^= xw[f[u]] ^ xw[u], f[u] = u, --tp;
}

ull ns[N];
vector < pair < int, int > > sol[N]; 

inline void dc(int x, int l, int r) {
    int mid = (l + r) >> 1, lt = tp;
    for(auto u : sol[x]) {
    	int x = find(u.first), y = find(u.second); 
    	if(siz[x] > siz[y]) swap(x, y);
    	if(x == y) continue;
    	SUM ^= xw[x] ^ xw[y];
		f[x] = y, siz[y] += siz[x], xw[y] += xw[x], stk[++tp] = x;
		SUM ^= xw[y];
	}
	if(l == r) {
		ns[id[l]] = SUM;
//		cout << "SUM = " << SUM << '\n';
    } else {
    	dc(x << 1, l, mid), dc(x << 1 | 1, mid + 1, r);
	}
	sol[x].clear();
	while(tp > lt) revoke();
}

void mark(int x, int L, int R, int l, int r, pair < int, int > pr) {
	if(l <= L && R <= r) return sol[x].push_back(pr), void();
	int mid = (L + R) >> 1;
	if(l <= mid) mark(x << 1, L, mid, l, r, pr);
	if(r > mid) mark(x << 1 | 1, mid + 1, R, l, r, pr);
}

int n, m, k, tot = 1;

vi e[N];
map < pair < int, int >, int > mp;
string str[N];
int xu[N], xv[N];

void lk(int u, int v, int t) {
	mp[make_pair(u, v)] = t;
}
void del(int u, int v, int t) {
	int ti = mp[make_pair(u, v)];
	if(ti < t) mark(1, 1, k, ti, t - 1, {u, v});
	mp.erase(make_pair(u, v));
}

void dfs(int x) {
	if(xu[x] > xv[x]) swap(xu[x], xv[x]);
	if(x > 1) {
		++tot;
		if(str[x] == "add") lk(xu[x], xv[x], tot);
		if(str[x] == "remove") del(xu[x], xv[x], tot);
	}
	id[tot] = x;
	
	for(const int &v : e[x]) dfs(v);
	
	if(x > 1) {
		if(str[x] == "add") del(xu[x], xv[x], tot + 1);
		if(str[x] == "remove") lk(xu[x], xv[x], tot + 1);
	} 
}

map < ull, vi > ovo;
void Main() {
	mp.clear(), ovo.clear();
	cin >> k >> n >> m, SUM = 0;
	L(i, 1, n) xw[i] = orz(), f[i] = i, siz[i] = 1, SUM ^= xw[i];
	
	tot = 1;
	L(i, 1, m) {
		int u, v;
		cin >> u >> v;
		if(u > v) swap(u, v);
		lk(u, v, 1);
	}
	L(t, 2, k) {
		int fa;
		cin >> fa, e[fa].emplace_back(t);
		cin >> str[t] >> xu[t] >> xv[t];
	}
	dfs(1);
	for(auto u : mp) if(u.second <= k) mark(1, 1, k, u.second, k, u.first);
	dc(1, 1, k);
	
	L(i, 1, k) ovo[ns[i]].emplace_back(i);
	cout << sz(ovo) << '\n';
	for(auto u : ovo) {
		cout << sz(u.second) << ' ';
		for(auto p : u.second) cout << p << ' ';
		cout << '\n';
	}
	
	L(i, 1, k) e[i].clear();
} 

int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t;
	cin >> t;
	while(t--) Main();
	return 0;
}