#include <bits/stdc++.h>
int map (char c)
{
	if (c == 'A') return 0;
	if (c == 'C') return 0;
	if (c == 'G') return 0;
	if (c == 'T') return 0;
}
const long long inf = 1LL << 60;
const int maxn = 1 << 19;
struct Trie
{
	int tot, ch[maxn][4]; long long min[maxn];
	void build (void) {tot = 1;}
	void clear (void) {for (int i = 1; i <= tot; i++) ch[i][0] = ch[i][1] = ch[i][2] = ch[i][3] = 0;}
} Tr[2];
int n, m, q; char S[maxn], T[maxn]; long long f[maxn];
void solve (void)
{
	scanf("%s%d", S + 1, &q); n = strlen(S + 1);
	Tr[0].build(); Tr[1].build();
	for (int i = 1; i <= q; i++)
	{
		long long w; scanf("%s%lld", T + 1, &w); m = strlen(T + 1);
		for (int j = 1, u = 1; j <= m; j++)
		{
			int &k = Tr[0].ch[u][map(T[j])];
			if (!k) Tr[0].min[k = ++Tr[0].tot] = inf;
			u = k; Tr[0].min[u] = std::min(Tr[0].min[u], w);
		}
		for (int j = m, u = 1; j >= 1; j--)
		{
			int &k = Tr[1].ch[u][map(T[j])];
			if (!k) Tr[1].min[k = ++Tr[1].tot] = inf;
			u = k; Tr[1].min[u] = std::min(Tr[1].min[u], w);
		}
	}
	for (int i = 1; i <= n; i++) f[i] = inf;
	for (int i = 0; i <= n; i++)
	{
		for (int u = 1, j = i; j >= 1 and Tr[1].ch[u][map(S[j])]; j--) f[i] = std::min(f[i], f[j - 1] + Tr[1].min[u = Tr[1].ch[u][map(S[j])]]);
		for (int u = 1, j = i + 1; j <= n and Tr[0].ch[u][map(S[j])]; j++) f[j] = std::min(f[j], f[i] + Tr[0].min[u = Tr[0].ch[u][map(S[j])]]);
	}
	printf("%lld\n", f[n] == inf ? -1 : f[n]);
	Tr[0].clear(); Tr[1].clear();
}
signed main ()
{
	int T;
	for (scanf("%d", &T); T--; ) solve();
	return 0;	
}