#include <set>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define N (500010)
#define inf (0x3f3f3f3f)
#define INF (0x3f3f3f3f3f3f3f3fll)
#define int long long
int T, n, m, a[N], dp[N], Min[N * 4];
struct Segment {
	int l, r;
	friend bool operator< (const Segment& a, const Segment& b) {
		return a.r == b.r ? a.l < b.l : a.r < b.r;
	}
} Seg[N];

inline int read() {
	int x = 0, f = 1; char ch = getchar();
	while (ch < '0' || ch > '9')
		ch == '-' ? f = -1, ch = getchar() : ch = getchar();
	while (ch >= '0' && ch <= '9')
		x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
	return x * f;
}

void build(int x, int l, int r) {
	Min[x] = INF;
	if (l == r) return;
	int mid = (l + r) >> 1;
	build(x * 2, l, mid), build(x * 2 + 1, mid + 1, r);
}

void Modify(int x, int l, int r, int pos, int val) {
	if (l == r) {
		Min[x] = val;
		return;
	}
	int mid = (l + r) >> 1;
	if (pos <= mid) Modify(x * 2, l, mid, pos, val);
	else Modify(x * 2 + 1, mid + 1, r, pos, val);
	Min[x] = min(Min[x * 2], Min[x * 2 + 1]);
} 

int Query(int x, int l, int r, int a, int b) {
	if (a <= l && r <= b) return Min[x];
	int mid = (l + r) >> 1;
	if (b <= mid) return Query(x * 2, l, mid, a, b);
	else if (a > mid) return Query(x * 2 + 1, mid + 1, r, a, b);
	else return min(Query(x * 2, l, mid, a, mid), Query(x * 2 + 1, mid + 1, r, mid + 1, b));
}

signed main() {
	// ios::sync_with_stdio(false);
	T = read();
	while (T--) {
		n = read();
		for (int i = 1; i <= n; ++i) a[i] = read();
		a[++n] = 0; // 统计答案使用
		m = read();
		for (int i = 1; i <= m; ++i) Seg[i].l = read(), Seg[i].r = read();
		sort(Seg + 1, Seg + m + 1);
		build(1, 1, n);
		int pre = 0;
		for (int i = 1; i <= n; ++i) {
			while (pre < m && Seg[pre + 1].r < i) pre++;
			int tmp = !pre ? 0 : Query(1, 1, n, Seg[pre].l, Seg[pre].r);
			dp[i] = tmp + a[i];
			// printf("%lld %lld %lld %lld %lld\n", i, Seg[pre].l, Seg[pre].r, tmp, dp[i]);
			Modify(1, 1, n, i, dp[i]);
		}
		// for (int i = 1; i <= n; ++i) printf("%d %d\n", i, dp[i]);
		printf("%lld\n", dp[n]);
	}
	return 0;
}