#include <bits/stdc++.h>

typedef unsigned long long ull;

const int P = 998244353;

int norm(int x) { return x >= P ? x - P : x; }
int reduce(int x) { return x < 0 ? x + P : x; }
int neg(int x) { return x ? P - x : 0; }
void add(int& x, int y) { if ((x += y - P) < 0) x += P; }
void sub(int& x, int y) { if ((x -= y) < 0) x += P; }
void fam(int& x, int y, int z) { x = (x + y * (ull)z) % P; }
int mpow(int x, unsigned k) {
	if (k == 0) return 1;
	int ret = mpow(x * (ull)x % P, k >> 1);
	if (k & 1) ret = ret * (ull)x % P;
	return ret;
}

const int N = 210;

int f[N][N], g[N][N];
int n[N], m[N];

int det(int n) {
	int ret = 1;
	for (int i = 1; i <= n; ++i) {
		int pivot = i;
		while (!f[pivot][i] && pivot <= n) ++pivot;
		if (pivot > n) return 0;
		if (pivot != i) {
			ret = P - ret;
			for (int j = i; j <= n; ++j) std::swap(f[i][j], f[pivot][j]);
		}
		ret = ret * (ull)f[i][i] % P;
		int nv = mpow(f[i][i], P - 2);
		for (int j = i; j <= n; ++j) f[i][j] = f[i][j] * (ull)nv % P;
		for (int j = i + 1; j <= n; ++j) for (int k = n; k >= i; --k)
			f[j][k] = (f[j][k] + (P - f[j][i]) * (ull)f[i][k]) % P;
	}
	return ret;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr); std::cout.tie(nullptr);

	int T; std::cin >> T;
	while (T--) {
		int k; std::cin >> k;
		for (int i = 1; i <= k; ++i) std::cin >> n[i];
		for (int i = 1; i != k; ++i) std::cin >> m[i];
		memset(f, 0, sizeof(f));
		for (int i = 1; i <= n[1]; ++i) f[i][i] = 1;
		for (int i = 1; i != k; ++i) {
			memset(g, 0, sizeof(g));
			while (m[i]--) {
				int u, v; std::cin >> u >> v;
				for (int i = 1; i <= n[1]; ++i)
					add(g[v][i], f[u][i]);
			}
			memcpy(f, g, sizeof(f));
		}
		std::cout << det(n[1]) << '\n';
	}

	return 0;
}