#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(), _a.end()
#define rep(i,p,q) for (int i=(p);i<=(q);i++)
#define pre(i,p,q) for (int i=(p);i>=(q);i--)
const int N=1e5+5; int n,a[N],p[N],f[N];
void solve(){
    int m,l,r; queue<int>q;
    cin>>n;
    rep(i,1,n) cin>>a[i];
    n++;
    rep(i,1,n) f[i]=1e9,p[i]=0;
    cin>>m;
    rep(i,1,m) cin>>l>>r,p[r]=max(p[r],l);
    rep(i,1,n) p[i]=max(p[i],p[i-1]);
    q.push(0);
    rep(i,1,n) {
        for (;q.size()&&q.front()<p[i-1];) q.pop();
        f[i]=f[q.front()]+a[i];
        for (;q.size()&&f[q.front()]>f[i];) q.pop();
        q.push(i);
    }
    cout<<f[n]<<"\n";
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cout << setiosflags(ios::fixed) << setprecision(15);
    int T;
    T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}