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

typedef long long LL;
typedef map<int, int>::iterator MIT;
const int N = 2e5 + 5, S = N * 6, M = N * 7, L = 19;

int n, m, na, nb, La[N], Ra[N], Lb[N], Rb[N], fa[S][L], dep[S], q[S], in[S];
LL f[S], w[S];

char s[N];

map<int, int> mp[S];

int head[S], numE = 0, cnt;

struct E{
	int next, v;
} e[M];

int last = 1, idx = 1, pos[N];

vector<int> g[S];

struct SAM{
	int ch[26], link, len;
} t[S];

void inline insert(int c, int i) {
	int x = ++idx, p = last; t[x].len = t[p].len + 1; pos[i] = x;
	while (p && !t[p].ch[c]) t[p].ch[c] = x, p = t[p].link;
	if (!p) t[x].link = 1;
	else {
		int q = t[p].ch[c];
		if (t[p].len + 1 == t[q].len) t[x].link = q;
		else {
			int y = ++idx; t[y] = t[q], t[y].len = t[p].len + 1;
			while (p && t[p].ch[c] == q) t[p].ch[c] = y, p = t[p].link;
			t[q].link = t[x].link = y;
		}
	}
	last = x;
}

void inline add(int u, int v) {
	in[v]++;
	e[++numE] = (E) { head[u], v };
	head[u] = numE;
}

void inline clear() {
	for (int i = 1; i <= n; i++) pos[i] = 0;
	for (int i = 0; i <= na + nb + cnt; i++) {
		dep[i] = 0, head[i] = 0;
		g[i].clear(), mp[i].clear(), in[i] = 0;
		for (int j = 0; j < 26; j++) t[i].ch[j] = 0;
		t[i].len = t[i].link = 0;
		for (int j = 0; j < L; j++) fa[i][j] = 0;
	}
	numE = 0; last = 1, idx = 1;
}

void dfs(int u) {
	for (int i = 1; i < L; i++)
		fa[u][i] = fa[fa[u][i - 1]][i - 1];
	for (int i = 0; i < g[u].size(); i++) {
		int v = g[u][i];
		if (v == fa[u][0]) continue;
		dep[v] = dep[u] + 1, fa[v][0] = u;
		dfs(v);
	}
}

int inline get(int l, int r) {
	int x = pos[r], len = r - l + 1;
	for (int i = L - 1; ~i; i--) 
		if (len <= t[fa[x][i]].len) x = fa[x][i];
	if (!mp[x].count(len)) mp[x][len] = ++cnt;
	return mp[x][len];
}

void inline change(int &x, int &y) {
	int t1 = n - y + 1, t2 = n - x + 1;
	x = t1, y = t2;
}

LL inline toposort() {
	int hh = 1, tt = 0; LL res = 0;
	for (int i = 1; i <= na + nb + cnt; i++) {
		if (!in[i]) q[++tt] = i;
		f[i] = w[i] = i <= na ? Ra[i] - La[i] + 1 : 0;
	}
	while (hh <= tt) {
		int u = q[hh++]; res = max(res, f[u]);
		for (int i = head[u]; i; i = e[i].next) {
			int v = e[i].v;
			f[v] = max(f[v], f[u] + w[v]);
			if (--in[v] == 0) q[++tt] = v;
		}
	}
	if (tt != na + nb + cnt) return -1;
	return res;
}

int main() {
	int T; scanf("%d", &T);
	for (int ca = 1; ca <= T; ca++) {
		scanf("%s%d", s + 1, &na); n = strlen(s + 1);
		reverse(s + 1, s + 1 + n);
		for (int i = 1; i <= n; i++) insert(s[i] - 'a', i);
		for (int i = 1; i <= idx; i++) mp[i][t[i].len] = i;
		cnt = idx;
		for (int i = 2; i <= idx; i++) g[t[i].link].push_back(i);
		dfs(1);
		for (int i = 1; i <= na; i++) scanf("%d%d", La + i, Ra + i), change(La[i], Ra[i]);
		scanf("%d", &nb);
		for (int i = 1; i <= nb; i++) scanf("%d%d", Lb + i, Rb + i), change(Lb[i], Rb[i]);
		for (int i = 1; i <= na; i++) add(get(La[i], Ra[i]) + na + nb, i);
		for (int i = 1; i <= nb; i++) add(i + na, get(Lb[i], Rb[i]) + na + nb);
		for (int i = 1; i <= idx; i++) {
			int t = -1;
			if (mp[fa[i][0]].size()) t = (--mp[fa[i][0]].end()) -> second;
			for (MIT it = mp[i].begin(); it != mp[i].end(); it++) {
				if (t != -1) add(t + na + nb, it -> second + na + nb);
				t = it -> second;
			}
		}
		scanf("%d", &m);
		while (m--) {
			int x, y; scanf("%d%d", &x, &y);
			add(x, na + y);
		}
		printf("%lld\n", toposort());
		clear();
	}
	return 0;
}