#include <bits/stdc++.h>
using namespace std;
const int maxn = 2505, mod = 998244353;
int qmod(int x) { return x >= mod ? x - mod : x; }
template <typename T>
void read(T &x)
{
	T sgn = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') sgn = -1;
	for (x = 0; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	x *= sgn;
}
int C[2], D[2];
int n, m, c, b[maxn], s[maxn], t[maxn];
int f[maxn], g[maxn];
vector<int> vec[maxn];
int h[maxn][305], tmp[maxn][305];
int r[305], e[305], cnt[maxn];
int mark[maxn], ans;
void MAIN()
{
	int tot = 0;
	read(n); read(c);
	for (int i = 1; i <= n; i++) mark[i] = -1;
	for (int i = 1; i <= c; i++) t[i] = cnt[i] = 0, vec[i].clear();
	read(C[0]); read(C[1]); read(D[0]); read(D[1]);
	int M = max({C[0], C[1], D[0], D[1]});
	for (int i = 1; i <= n; i++)
		read(b[i]), read(s[i]), t[b[i]] += s[i], tot += s[i];
	read(m);
	for (int i = 1, j; i <= m; i++)
	{
		read(j); read(mark[j]);
		vec[b[j]].push_back(j);
		cnt[b[j]] += s[j];
	}
	memset(f, 0, sizeof(f));
	memset(g, 0, sizeof(g));
	memset(h, 0, sizeof(h));
	f[0] = g[0] = h[0][0] = 1;
	for (int i = 1; i <= c; i++) if (t[i] && vec[i].size() == 0)
		for (int j = M; j >= t[i]; j--)
			f[j] = qmod(f[j] + f[j - t[i]]);
	for (int i = 1; i <= n; i++) if (mark[i] == -1)
		for (int j = M; j >= s[i]; j--)
			g[j] = qmod(g[j] + g[j - s[i]]);
	for (int i = 1; i <= M; i++)
	{
		f[i] = qmod(f[i] + f[i - 1]);
		g[i] = qmod(g[i] + g[i - 1]);
	}
	int lst = 0;
	for (int i = 1; i <= c; i++) if (t[i] && vec[i].size())
	{
		memcpy(tmp, h, sizeof(tmp));
		memset(h, 0, sizeof(h));
		lst += cnt[i];
		for (int o = 0; o < 2; o++)
		{
			memset(r, 0, sizeof(r));
			r[0] = 1;
			for (int j : vec[i])
			{
				memcpy(e, r, sizeof(e)); 
				memset(r, 0, sizeof(r));
				for (int k = 0; k <= cnt[i]; k++)
					for (int p = 0; p < 2; p++) if (mark[j] != ((o << 1) | p))
					{
						if (k >= p * s[j]) r[k] = qmod(r[k] + e[k - p * s[j]]);
					}
			}
			for (int j = 0; j <= M; j++) if (j >= o * t[i])
				for (int k = 0; k <= lst; k++)
					for (int l = 0; l <= cnt[i]; l++)
						h[j][k] = qmod(h[j][k] + 1ll * tmp[j - o * t[i]][k - l] * r[l] % mod);
		}
	} ans = 0;
	for (int i = 0; i <= M; i++)
	{
		for (int j = 0; j <= m * 10; j++) if (h[i][j])
		{
			int l = max(tot - C[0] - i, 0), r = C[1] - i;
			if (l > r || r < 0) continue;
			int v1 = qmod(f[r] - (l == 0 ? 0 : f[l - 1]) + mod);
			l = max(tot - D[0] - j, 0), r = D[1] - j;
			if (l > r || r < 0) continue;
			int v2 = qmod(g[r] - (l == 0 ? 0 : g[l - 1]) + mod);
			if (!v1 || !v2) continue;
			ans = qmod(ans + 1ll * v1 * v2 % mod * h[i][j] % mod);
		}
	}
	printf("%d\n", ans);
}

int main()
{
	int T;
	read(T);
	while (T--) MAIN();
	return 0;
}