#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N = 2e6 + 10;
int n, m, k;
int a[N], b[N], dp[N], f[N], num, ans;
struct node
{
    int x, y; /* data */
} q[N];
bool cmp(node w, node v)
{
    return w.x < v.x;
}

void solve()
{
    cin >> n;

    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        b[i] = 0;
    }
    cin >> m;

    for (int i = 1; i <= m; i++)
    {

        int x, y;
        cin >> x >> y;
        b[y] = max(b[y], x);
    }
    int h = 1, d = 1;
    f[1] = 0;
    for (int i = 1; i <= n; i++)
    {
        dp[i] = dp[f[h]] + a[i];
        while (h <= d && dp[f[d]] > dp[i])
            d--;
        f[++d] = i;
        //cout << i << " " << f[h] << " " << dp[i] << " " << b[i] << "\n";
        while (h <= d && f[h] < b[i])
            h++;
        
        
       //cout<<dp[i]<<" ";
    }
    cout << dp[n] << "\n";
}
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;
}