#include <bits/stdc++.h>
#define forn(i,aa,bb) for(int i=aa;i<=bb;++i)
#define LL long long 
#define pii pair<int,int>
#define int long long 
using namespace std;
const int N=3e3+5;
const LL mod=998244353;
int n,c;
int f[2][N][N];
int f1[N],g1[N];
vector<int> G[N];
int b[N],h[N]; 
int C1,C0,D1,D0;
int tot=0;
int now,pre;
void clear() {
    tot=min(max({C0,C1,D0,D1}),tot);
    forn(i,0,1)
        forn(j,0,tot)
            forn(k,0,tot) 
                f[i][j][k]=0;
    forn(i,0,tot) {
        G[i].clear();
        b[i]=0;
        h[i]=0;
        f1[i]=g1[i]=0;
    }
}
void solve_no_hate() {
    f1[0]=1ll; g1[0]=1ll;
    forn(i,1,c) {
        if (G[i].empty()) continue;
        int sum1=0;
        //check 
        bool fl=0;
        for(int x:G[i]) { 
            if (h[x]) {
                fl=1;
                break;
            }
            sum1+=b[x];
        }

        //solve_zhenying
        if (!fl) {
            for(int j=tot-sum1;j>=0;--j)
                f1[j+sum1]=(f1[j+sum1]+f1[j])%mod;
        }

        //solve_paixi
        for(int x:G[i]) {
            if (h[x]) continue;
            for(int j=tot-b[x];j>=0;--j)
                g1[j+b[x]]=(g1[j+b[x]]+g1[j])%mod;
        }
    }
    forn(i,1,tot)  {
        f1[i]=(f1[i]+f1[i-1])%mod;
        g1[i]=(g1[i]+g1[i-1])%mod;
    }
}
void solve_hate() {
    now=0; pre=1;
    int maxm=0;
    f[0][0][0]=1ll;
    forn(i,1,c) {
        if (G[i].empty()) continue;
        int sum1=0;
        //check 
        bool fl=0;
        for(int x:G[i]) {
            if (h[x]) fl=1;
            sum1+=b[x];
        }
        if (!fl) continue;

        swap(now,pre);
        for(int x:G[i]) {
            if (!h[x]) continue;
            forn(j,0,tot)
                forn(k,0,maxm)
                    f[now][j][k]=0;
            for(int j=tot;j>=0;--j)
                for(int k=maxm;k>=0;--k) {
                    if (h[x]==1) {
                        if (j+sum1<=tot) f[now][j+sum1][k]=(f[now][j+sum1][k]+f[pre][j][k])%mod;
                        if (k+b[x]<=tot) f[now][j][k+b[x]]=(f[now][j][k+b[x]]+f[pre][j][k])%mod;
                        f[now][j][k]=(f[now][j][k]+f[pre][j][k])%mod;
                    }
                    if (h[x]==2) {
                        if (j+sum1<=tot && k+b[x]<=tot) f[now][j+sum1][k+b[x]]=(f[now][j+sum1][k+b[x]]+f[pre][j][k])%mod;
                        if (k+b[x]<=tot) f[now][j][k+b[x]]=(f[now][j][k+b[x]]+f[pre][j][k])%mod;
                        f[now][j][k]=(f[now][j][k]+f[pre][j][k])%mod;
                    }
                    if (h[x]==3) {
                        f[now][j][k]=(f[now][j][k]+f[pre][j][k])%mod;
                        if (j+sum1<=tot && k+b[x]<=tot) f[now][j+sum1][k+b[x]]=(f[now][j+sum1][k+b[x]]+f[pre][j][k])%mod;
                        if (j+sum1<=tot) f[now][j+sum1][k]=(f[now][j+sum1][k]+f[pre][j][k])%mod;
                    }
                    if (h[x]==4) {
                        f[now][j][k+b[x]]=(f[now][j][k+b[x]]+f[pre][j][k])%mod;
                        if (j+sum1<=tot && k+b[x]<=tot) f[now][j+sum1][k+b[x]]=(f[now][j+sum1][k+b[x]]+f[pre][j][k])%mod;
                        if (j+sum1<=tot) f[now][j+sum1][k]=(f[now][j+sum1][k]+f[pre][j][k])%mod;
                    }
                }
            maxm+=b[x];
        }
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    while (T--) {
        tot=0;
        cin>>n>>c;
        cin>>C0>>C1>>D0>>D1;
        forn(i,1,n) {
            int x;
            cin>>x>>b[i];
            G[x].push_back(i);
            tot+=b[i];
        }
        tot=min(max({C0,C1,D0,D1}),tot);
        int h1;
        cin>>h1;
        forn(i,1,h1) {
            int x,y;
            cin>>x>>y;
            h[x]=y+1;
        }
        solve_hate();
        solve_no_hate();
        int ans=0;
        tot=0;
        forn(i,1,n) 
            tot+=b[i];
        forn(i,0,C0) 
            forn(j,0,D0) {
                int pre1=tot-C1-i-1>=0?f1[tot-C1-i-1]:0,pre2=tot-D1-j-1>=0?g1[tot-D1-j-1]:0;
                ans=(ans+f[now][i][j]*(f1[C0-i]-pre1+mod)%mod*(g1[D0-j]-pre2+mod)%mod)%mod;
            }
        if (ans==0) cout<<f[now][0][0]<<' '<<f1[C0]<<' '<<g1[D0]<<'\n';
        cout<<ans<<'\n';
        clear();
    }
}