#include "bits/stdc++.h"
#define int long long
using namespace std;

int n, m;

void solve()
{
    cin >> n;
    vector<int> a(n + 2), R(n + 2);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        int l, r;
        cin >> l >> r;
        R[r] = max(R[r], l);
    }
    deque<int> q;
    q.emplace_back(0);
    vector<int> dp(n + 2);
    for (int i = 1; i <= n + 1; i++)
    {
        dp[i] = dp[q.front()] + a[i];
        while (q.size() && dp[q.back()] > dp[i])
        {
            q.pop_back();
        }
        q.emplace_back(i);
        if (q.size() && q.front() < R[i])
        {
            q.pop_front();
        }
    }
    cout << dp[n + 1] << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);

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