#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
const int N = 1e6;
const int M = 2e3;
void solve() {
    int n;
    cin >> n;
    vector<int> a(n + 2);
    vector<int> dp(n + 2);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int m;
    cin >> m;
    vector<int> ll(n + 2);
    for (int i = 1; i <= m; i++) {
        int l, r;
        cin >> l >> r;
        ll[r] = max(ll[r], l);
    }
    deque<int> q;
    q.push_back(0);
    for (int i = 1; i <= n+1; i++) {
        dp[i] = dp[q.front()] + a[i];
        q.push_back(i);
        while (!q.empty() && q.front() < ll[i])
            q.pop_front();
    }
    cout << dp[n + 1] << endl;

    return;
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}