// Skyqwq
#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;

typedef long long LL;

const int N = 1005, M = 2550, P = 998244353, S = 305;

int n, t, C[2], D[2], s[N], c[N], v[N], k, b[N], f[M], g[M], h[M][S], h1[M][S], h2[M][S], bh1[M][S], bh2[M][S], m; 

int d[N];

vector<int> e[N];

void inline clear() {
	for (int i = 1; i <= n; i++) e[i].clear(), s[i] = 0;
	for (int i = 0; i <= C[0]; i++) f[i] = 0;
	for (int i = 0; i <= D[0]; i++) g[i] = 0;
	for (int i = 0; i <= C[0]; i++)
		for (int j = 0; j <= m; j++) h[i][j] = 0;
}

void inline add(int &x, int y) { (x += y) %= P; }

int inline get(int x1, int x2, int y1, int y2) {
	int res = h[x2][y2];
	if (x1) res = (res - h[x1 - 1][y2] + P) % P;
	if (y1) res = (res - h[x2][y1 - 1] + P) % P;
	if (x1 && y1) res = (res + h[x1 - 1][y1 - 1]) % P;
	return res;
}

int main() {
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d%d%d%d", &n, &t, C, C + 1, D, D + 1); m = 0;
		for (int i = 1; i <= n; i++) b[i] = 0, d[i] = -1;
		for (int i = 1; i <= n; i++) scanf("%d%d", c + i, v + i), s[c[i]] += v[i];
		scanf("%d", &k);
		while (k--) {
			int i, p; scanf("%d%d", &i, &p);
			d[i] = p;
			b[c[i]] = 1;
			m += v[i];
		}
		for (int i = 1; i <= n; i++) e[c[i]].push_back(i);
		f[0] = 1, g[0] = 1, h[0][0] = 1;
		int s1 = 0, s2 = 0, s3 = 0, s4 = 0;
		for (int i = 1; i <= t; i++) {
			for (int j = 0; j < e[i].size(); j++) {
				int u = e[i][j];
				if (d[u] == -1) {
					s2 += v[u];
					for (int k = D[0]; k >= v[u]; k--)
						(g[k] += g[k - v[u]]) %= P;
				}
			}
			if (!b[i] && s[i]) {
				s1 += s[i];
				for (int j = C[0]; j >= s[i]; j--) (f[j] += f[j - s[i]]) %= P;
			}
		}
		for (int i = 1; i <= t; i++) {
			if (b[i]) {
				s3 += s[i];
				memcpy(h1, h, sizeof h1);
				memcpy(h2, h, sizeof h2);
				for (int j = 0; j < e[i].size(); j++) {
					int u = e[i][j];
					if (d[u] == -1) continue;
					s4 += v[u];
					memcpy(bh1, h1, sizeof bh1);
					memcpy(bh2, h2, sizeof bh2);
					memset(h1, 0, sizeof h1);
					memset(h2, 0, sizeof h2);
					for (int x = C[0]; ~x; x--) {
						for (int y = m; ~y; y--) {
							if (d[u] != 0 && y >= v[u]) h1[x][y] = bh1[x][y - v[u]];
							if (d[u] != 1) add(h1[x][y], bh1[x][y]);
							if (d[u] != 2 && y >= v[u]) add(h2[x][y], bh2[x][y - v[u]]);
							if (d[u] != 3) add(h2[x][y], bh2[x][y]);
						}
					}
				}
				for (int x = C[0]; x >= s[i]; x--) {
					for (int y = 0; y <= m; y++)
						h1[x][y] = h1[x - s[i]][y];
				}
				for (int x = 0; x < s[i]; x++)
					for (int y = 0; y <= m; y++) h1[x][y] = 0;
				for (int x = C[0]; ~x; x--) {
					for (int y = m; ~y; y--) {
						h[x][y] = (h1[x][y] + h2[x][y]) % P;
					}
				}
			}
		}
		for (int i = 0; i <= C[0]; i++) {
			for (int j = 0; j <= m; j++) {
				if (i) add(h[i][j], h[i - 1][j]);
				if (j) add(h[i][j], h[i][j - 1]);
				if (i && j) add(h[i][j], P - h[i - 1][j - 1]);
			}
		}
		int ans = 0;
		for (int i = 0; i <= C[0]; i++) {
			if (s1 - i < 0 || s1 - i > C[1] || !f[i]) continue;
			for (int j = 0; j <= D[0]; j++) {
				if (s2 - j < 0 || s2 - j > D[1] || !g[j]) continue;
				int L1 = max(0, s1 - i + s3 - C[1]), R1 = min(C[0], C[0] - i);
				int L2 = max(0, s2 - j + s4 - D[1]), R2 = min(m, D[0] - j);
				add(ans, (LL)f[i] * g[j] % P * get(L1, R1, L2, R2) % P);
			}
		}
		printf("%d\n", ans);
		clear();
	}
	return 0;
}