#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const long long P = 998244353;

const int N = 1000;
int n, c;
int C[5], D[5];
int special;

struct School {
	int city, student, dislike;
}a[N + 5], b[N + 5];

const int M = 2500;
long long f[M + 5], g[M + 5];
long long preF[M + 5], preG[M + 5];

int box[N + 5];
bool hate[N + 5];

void calcF()//city only
{
	f[0] = 1;
	for (int i = 1, sum = 0; i <= c; i++)
	{
		if (!box[i] || hate[i])
			continue;
		sum += box[i];
		for (int j = C[0]; j >= 0; j--)
		{
			if (sum - j > C[1])
			{
				f[j] = 0;
				continue;
			}
			if (j >= box[i])
				f[j] = (f[j] + f[j - box[i]]) % P;
		}
	}
	preF[0] = f[0];
	for (int i = 1; i <= C[0]; i++)
		preF[i] = (preF[i - 1] + f[i]) % P;
	return ;
}
void calcG()//school only
{
	g[0] = 1;
	for (int i = 1, sum = 0; i <= n; i++)
	{
		if (a[i].dislike != -1)
			continue;
		sum += a[i].student;
		for (int j = D[0]; j >= 0; j--)
		{
			if (sum - j > D[1])
			{
				g[j] = 0;
				continue;
			}
			if (j >= a[i].student)
				g[j] = (g[j] + g[j - a[i].student]) % P;
		}
	}
	preG[0] = g[0];
	for (int i = 1; i <= D[0]; i++)
		preG[i] = (preG[i - 1] + g[i]) % P;
	return ;
}
long long getSum(int l, int r, long long v[])
{
	if (l > r)
		return 0;
	if (l <= 0)
		return v[r];
	return (v[r] - v[l - 1] + P) % P;
}

const int K = 30, Max = 300;
long long dp[2][2][M + 5][Max + 5];
long long Combine[M + 5][Max + 5];
bool cmp(School A, School B)
{
	return A.city < B.city;
}
void calcDP()
{
	sort(b + 1, b + special + 1, cmp);
	int sum = 0, p = 0;
	dp[0][0][0][0] = 1;
	for (int i = 1; i <= special; i++)
	{
		sum += b[i].student;
		bool ChangeCity = (b[i - 1].city != b[i].city);
		for (int j = 0; j <= C[0]; j++)
		for (int k = 0; k <= min(D[0], sum); k++)
		{
			if (b[i].dislike != 0)
			{
				if (ChangeCity && j >= box[b[i].city] && k >= b[i].student)
				{
					dp[p ^ 1][0][j][k] = (dp[p ^ 1][0][j][k] + dp[p][0][j - box[b[i].city]][k - b[i].student]
									 + dp[p][1][j - box[b[i].city]][k - b[i].student]) % P;
				}
				if (!ChangeCity && k >= b[i].student)
				{
					dp[p ^ 1][0][j][k] = (dp[p ^ 1][0][j][k] + dp[p][0][j][k - b[i].student]) % P;
				}
			}
			
			if (b[i].dislike != 1)
			{
				if (ChangeCity && j >= box[b[i].city])
				{
					dp[p ^ 1][0][j][k] = (dp[p ^ 1][0][j][k] + dp[p][0][j - box[b[i].city]][k]
									 + dp[p][1][j - box[b[i].city]][k]) % P;
				}
				if (!ChangeCity)
				{
					dp[p ^ 1][0][j][k] = (dp[p ^ 1][0][j][k] + dp[p][0][j][k]) % P;
				}
			}
			
			if (b[i].dislike != 2)
			{
				if (ChangeCity && k >= b[i].student)
				{
					dp[p ^ 1][1][j][k] = (dp[p ^ 1][1][j][k] + dp[p][0][j][k - b[i].student]
									 + dp[p][1][j][k - b[i].student]) % P;
				}
				if (!ChangeCity && k >= b[i].student)
				{
					dp[p ^ 1][1][j][k] = (dp[p ^ 1][1][j][k] + dp[p][1][j][k - b[i].student]) % P;
				}
			}
			
			if (b[i].dislike != 3)
			{
				if (ChangeCity)
				{
					dp[p ^ 1][1][j][k] = (dp[p ^ 1][1][j][k] + dp[p][0][j][k]
									 + dp[p][1][j][k]) % P;
				}
				if (!ChangeCity)
				{
					dp[p ^ 1][1][j][k] = (dp[p ^ 1][1][j][k] + dp[p][1][j][k]) % P;
				}
			}
		}
		
		for (int j = 0; j <= C[0]; j++)
		for (int k = 0; k <= min(D[0], sum); k++)
			dp[p][0][j][k] = dp[p][1][j][k] = 0;
		p ^= 1;
	}
	
	for (int i = 0; i <= C[0]; i++)
	for (int j = 0; j <= min(D[0], sum); j++)
		Combine[i][j] = (dp[p][0][i][j] + dp[p][1][i][j]) % P;
	return ;
}

void solve()
{
	int sum = 0;
	
	scanf("%d%d", &n, &c);
	scanf("%d%d%d%d", &C[0], &C[1], &D[0], &D[1]);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d", &a[i].city, &a[i].student);
		a[i].dislike = -1;
		
		sum += a[i].student;
		box[a[i].city] += a[i].student;
	}
	
	scanf("%d", &special);
	for (int i = 1, pos; i <= special; i++)
	{
		scanf("%d", &pos);
		scanf("%d", &a[pos].dislike);
		b[i] = a[pos];
		hate[b[i].city] = 1;
	}
	
	calcF();
	calcG();
	calcDP();
	
	long long ans = 0;
	for (int i = 0; i <= C[0]; i++)
	for (int j = 0; j <= min(D[0], Max); j++)
	{
		long long F = getSum(sum - i - C[1], C[0] - i, preF);
		long long G = getSum(sum - j - D[1], D[0] - j, preG);
		ans = (ans + F * G % P * Combine[i][j] % P) % P;
	}
	printf("%lld\n", ans);
	
	memset(f, 0, sizeof(f));
	memset(g, 0, sizeof(g));
	memset(preF, 0, sizeof(preF));
	memset(preG, 0, sizeof(preG));
	memset(dp, 0, sizeof(dp));
	memset(Combine, 0, sizeof(Combine));
	memset(box, 0, sizeof(box));
	memset(hate, 0, sizeof(hate));
	return ;
}

int main()
{
//	#define HACK
	#ifdef HACK
	freopen("data.in", "r", stdin);
	freopen("mycode.out", "w", stdout);
	#endif
	
	int T;
	scanf("%d", &T);
	while (T--)
		solve();
	return 0;
}