#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 5e5 + 10;

int n, m;
int a[N];
ll dp[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T -- ) {
		cin >> n;
		for(int i = 1; i <= n; i ++ ) cin >> a[i];
		cin >> m;
		vector<pair<int, int>> seq(m + 1);
		for(int i = 0; i < m; i ++ ) {
			cin >> seq[i].first >> seq[i].second;
		}
		seq[m] = {n + 1, n + 1};
		sort(seq.begin(), seq.end());

		vector<bool> has(n + 1, false);
		for(int i = 0; i <= n + 1; i ++ ) dp[i] = 0;
		for(int i = 0; i < m; i ++ ) {
			has[seq[i].second] = true;
		}

		for(int i = n; i >= 1; i -- ) {
			if(has[i]) {
				dp[i] = dp[i + 1] + a[i];
			} else {
				dp[i] = dp[i + 1];
			}

			int l = 0, r = m;
			while(l < r) {
				int mid = (l + r) >> 1;
				if(seq[mid].first > i) r = mid;
				else l = mid + 1;
			}
			int pos = seq[l].first;
			dp[i] = min(dp[i], dp[pos] + a[i]);
		}
		cout << dp[1] << '\n';
	}
	return 0;
}