#include<bits/stdc++.h>
#define endl '\n'
//#define endl std::endl
#define i64 long long
#define pb push_back
#define pii std::pair<i64, i64>
#define INF 0x3f3f3f3f3f3f3f3f
const i64 N = 5e5 + 10;
i64 T, n, m, pos, ans;
i64 a[N], dp[N];
std::priority_queue<i64> pq;
struct tree {
	i64 val;
} t[N * 6];
struct rec {
	i64 l, r;
} p[N];
void pushup(i64 p) {
	t[p].val = std::min(t[p << 1].val, t[p << 1 | 1].val);
}
void add(i64 p, i64 l, i64 r, i64 x, i64 k) {
	if (l == r) {
		t[p].val = std::min(t[p].val, k);
		return;
	}
	i64 mid = (l + r) >> 1;
	if (x <= mid) add(p << 1, l, mid, x, k);
	else add(p << 1 | 1, mid + 1, r, x, k);
	pushup(p);
}
i64 query(i64 p, i64 l, i64 r, i64 x, i64 y) {
	if (y < x) return 0;
	if (x <= l && r <= y) return t[p].val;
	i64 mid = (l + r) >> 1, res = INF;
	if (x <= mid) res = std::min(res, query(p << 1, l, mid, x, y));
	if (y > mid) res = std::min(res, query(p << 1 | 1, mid + 1, r, x, y));
	return res;
}
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0), std::cout.tie(0);
	std::cin >> T;
	while (T--) {
		std::cin >> n;
		for (i64 i = 1; i <= n; i++)
			std::cin >> a[i];
		std::cin >> m;
		for (i64 i = 1; i <= m; i++)
			std::cin >> p[i].l >> p[i].r;
		std::sort(p + 1, p + m + 1, [](auto x, auto y){ return x.r < y.r || x.r == y.r && x.l < y.l; });
		pos = 1;
		for (i64 i = 1; i <= n * 6; i++)
			t[i].val = INF;
		//std::cout << "*" << endl;
		while (!pq.empty()) pq.pop();
		pq.push(0);
		add(1, 0, n, 0, 0);
		for (int i = 1; i <= n; i++)
			dp[i] = INF;
		for (i64 i = 1; i <= n; i++) {
			while (p[pos].r < i && pos < m) pq.push(p[pos].l), pos++;
			dp[i] = query(1, 0, n, pq.top(), i - 1) + a[i];
			add(1, 0, n, i, dp[i]);
		//std::cout << "*" << endl;
		}
		//std::cout << "*" << endl;
		ans = INF;
		/*for (i64 i = 1; i <= n; i++)
			std::cout << dp[i] << " ";
		std::cout << endl;
		*/for (i64 i = p[m].l; i <= p[m].r; i++)
			ans = std::min(ans, dp[i]);
		std::cout << ans << endl;
 	}
	return 0;
}