#include <cstdio>
#include <algorithm>
#define lx (x * 2)
#define rx (x * 2 + 1)
#define mid ((l + r) >> 1)
#define int long long

using namespace std;

const int N = 500000, INF = 0x3f3f3f3f;
int n, a[N + 5];
int ml[N + 5];

void init()
{
	scanf("%lld", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%lld", &a[i]);
		ml[i] = -INF;
	}
	int m;
	scanf("%lld", &m);
	while(m--)
	{
		int l, r;
		scanf("%lld %lld", &l, &r);
		ml[r] = max(ml[r], l);
	}
}

struct Tr
{
	int mx;
}tr[N * 4 + 5];
void pushup(int x)
{
	tr[x].mx = min(tr[lx].mx, tr[rx].mx);
}
void bld(int x, int l, int r)
{
	if(l == r)
	{
		tr[x].mx = INF;
		return;
	}
	bld(lx, l, mid);
	bld(rx, mid + 1, r);
}
void mdf(int x, int l, int r, int s, int k)
{
	if(l == r)
	{
		tr[x].mx = k;
		return;
	}
	if(s <= mid)
	{
		mdf(lx, l, mid, s, k);
	}
	else
	{
		mdf(rx, mid + 1, r, s, k);
	}
	pushup(x);
}
int ask(int x, int l, int r, int s, int t)
{
	if(l >= s && r <= t)
	{
		return tr[x].mx;
	}
	int ret = INF;
	if(s <= mid)
	{
		ret = min(ret, ask(lx, l, mid, s, t));
	}
	if( t > mid)
	{
		ret = min(ret, ask(rx, mid + 1, r, s, t));
	}
	return ret;
}

int f[N + 5][2];
void solve()
{
	bld(1, 1, n);
	if(ml[1] != -INF)
	{
		f[1][0] = INF;
		f[1][1] = a[1];
		mdf(1, 1, n, 1, f[1][1]);
	}
	for(int i = 2; i <= n; i++)
	{
		if(ml[i] != -INF)
		{
			if(ml[i] == i)
			{
				f[i][0] = INF;
				f[i][1] = min(f[i - 1][0], f[i - 1][1]) + a[i];
			}
			else
			{
				f[i][0] = ask(1, 1, n, ml[i], i - 1);
				f[i][1] = min(f[i - 1][0], f[i - 1][1]) + a[i];
			}
		}
		else
		{
			f[i][0] = min(f[i - 1][0], f[i - 1][1]);
			f[i][1] = f[i][0] + a[i];
		}
		mdf(1, 1, n, i, f[i][1]);
	}
	printf("%lld\n", min(f[n][0], f[n][1]));
}

void clr()
{
	
}

signed main()
{
	int T;
	scanf("%lld", &T);
	while(T--)
	{
		init();
		solve();
		clr();
	}
	return 0;
}