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

using i64 = long long;

void solve() {
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	int m;
	cin >> m;
	vector<vector<int>> g(n);
	for (int i = 0; i < m; ++i) {
		int l, r;
		cin >> l >> r;
		--l, --r;
		g[r].push_back(l);
	}



	vector<i64> dp(n);
	priority_queue<int> q;

	for (int i = 0; i < n; ++i) {
		if (!q.empty()) {
			dp[i] = dp[q.top()] + a[i];
		} else {
			dp[i] = a[i];
		}
		for (auto &l : g[i]) {
			q.push(l);
		}
	}
	cout << dp[n - 1] << '\n';

}

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

    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}