#include<bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 char str[maxn];

 int na,nb,len,m;

 int la[maxn],ra[maxn],lb[maxn],rb[maxn];

 int lst=,nxt[maxn<<][],fa[maxn<<],num=,maxlen[maxn<<],st[maxn];

 int lk[maxn],bh[maxn],maxnum;

 vector<pair<int,int> > g[maxn*];

 vector<int> chain[maxn<<];

 int in[maxn*];

 long long dis[maxn*];

 int RMQ[maxn<<][],nowmax;

 void buildRMQ(){

     RMQ[][] = ;

     for(int i=;i<=num;i++) RMQ[i][] = fa[i];

     for(int k=;(<<k)<=num;k++){

     nowmax = k;

     for(int i=;i<=num;i++) RMQ[i][k] = RMQ[RMQ[i][k-]][k-];

     }

 }

 int findhhh(int spp,int len){

     for(int i=nowmax;i>=;i--)if(maxlen[RMQ[spp][i]]>len) spp=RMQ[spp][i];

     return spp;

 }

 void init(){

     for(int i=;i<=num;i++) for(int j=;(<<j)<=num;j++)RMQ[i][j] = ;

     for(int i=;i<=num;i++){

     for(int j=;j<;j++)nxt[i][j] = ;

     fa[i] = ; maxlen[i] = ;

     chain[i].clear();

     }

     for(int i=;i<=len;i++) st[i] = ;

     for(int i=;i<=nb;i++)lk[i] = ;

     for(int i=;i<=na;i++) bh[i] = ;

     for(int i=;i<=maxnum+;i++)g[i].clear(),in[i] = ;

     lst = ; num = ; maxnum = ;

 }

 queue<int> que;

 void topu(){

     int sz = ;

     for(int i=;i<=maxnum+;i++) dis[i] = -1e18;

     for(int i=;i<=maxnum+;i++)

     if(!in[i]) que.push(i),sz++;

     dis[] = ;

     while(!que.empty()){

     int zz = que.front(); que.pop();

     for(int i=;i<g[zz].size();i++){

         int to = g[zz][i].first; in[to]--;

         if(!in[to]) sz++,que.push(to);

         dis[to] = max(dis[to],dis[zz]+g[zz][i].second);

     }

     }

     if(sz != maxnum+) puts("-1");

     else printf("%lld\n",dis[maxnum+]);

 }

 void addedge(int from,int to,int w){

     g[from].push_back(make_pair(to,w));

     in[to]++;

 }

 void ins(int now){

     int np = ++num,p=lst; maxlen[np] = maxlen[lst]+;

     st[len-now-] = np;

     for(;p&&!nxt[p][str[now]-'a'];p = fa[p]) nxt[p][str[now]-'a'] = np;

     if(!p) fa[np] = ;

     else{

     int q = nxt[p][str[now]-'a'];

     if(maxlen[q] == maxlen[p]+) fa[np] = q;

     else{

         int nq = ++num; maxlen[nq] = maxlen[p]+;

         for(int i=;i<;i++) nxt[nq][i] = nxt[q][i];

         fa[nq] = fa[q];

         fa[q] = nq; fa[np] = nq;

         for(;p&&nxt[p][str[now]-'a']==q;p=fa[p])nxt[p][str[now]-'a']=nq;

     }

     }

     lst = np;

 }

 void findpos(int now,int dt,int pp){

     if(chain[now].size() == ) return;

     int l = ,r = chain[now].size()-;

     while(l < r){

     int mid = (l+r)/;

     if(ra[chain[now][mid]]-la[chain[now][mid]]>=pp) r = mid;

     else l = mid+;

     }

     l = chain[now][l];

     if(ra[l]-la[l]<pp) return;

     addedge(bh[dt],bh[l],ra[dt]-la[dt]+);

 }

 int cmp(int alpha,int beta){

     if(ra[alpha]-la[alpha] < ra[beta]-la[beta]) return ;

     else return ;

 }

 void read(){

     scanf("%s",str);

     len = strlen(str);

     scanf("%d",&na);

     for(int i=;i<=na;i++) scanf("%d%d",&la[i],&ra[i]);

     for(int i=;i<=na;i++)la[i]=len-la[i],ra[i]=len-ra[i],swap(la[i],ra[i]);

     scanf("%d",&nb);

     for(int i=;i<=nb;i++) scanf("%d%d",&lb[i],&rb[i]);

     for(int i=;i<=nb;i++)lb[i]=len-lb[i],rb[i]=len-rb[i],swap(lb[i],rb[i]);

     for(int i=len-;i>=;i--) ins(i);

     buildRMQ();

     for(int i=;i<=num;i++){addedge(fa[i],i,);}

     for(int i=;i<=na;i++){

     int ym = findhhh(st[ra[i]],ra[i]-la[i]);

     chain[ym].push_back(i);

     }

     for(int i=;i<=num;i++) sort(chain[i].begin(),chain[i].end(),cmp);

     maxnum = num;

     for(int i=;i<=num;i++)

     for(int j=;j<chain[i].size();j++) bh[chain[i][j]] = ++maxnum;

     for(int i=;i<=num;i++)

     if(chain[i].size())addedge(fa[i],bh[chain[i][]],);

     for(int i=;i<=num;i++){

     for(int j=;j<(int)chain[i].size()-;j++)

         addedge(bh[chain[i][j]],bh[chain[i][j+]],);

     }

     for(int i=;i<=na;i++) addedge(,bh[i],);

     for(int i=;i<=na;i++) addedge(bh[i],maxnum+,ra[i]-la[i]+);

     for(int i=;i<=nb;i++){

     int ym = findhhh(st[rb[i]],rb[i]-lb[i]);

     lk[i] = ym;

     }

     scanf("%d",&m);

     for(int i=;i<=m;i++){

     int x,y; scanf("%d%d",&x,&y);

     addedge(bh[x],lk[y],ra[x]-la[x]+);

     findpos(lk[y],x,rb[y]-lb[y]);

     }

 }

 int main(){

     //freopen("1.in","r",stdin);

     int Tmp; scanf("%d",&Tmp);

     while(Tmp--){

     init();

     read();

     topu();

     }

     return ;

 }