// Problem: C. Trading
// Contest: Codeforces - The 2023 Guangdong Provincial Collegiate Programming Contest
// URL: https://codeforces.com/gym/104369/problem/C
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
using namespace std;
#define ll long long
# define int long long
#define ull unsigned long long
#define pii pair<int,int>
#define db double
#define baoliu(x, y) cout << fixed << setprecision(y) << x
#define endl  "\n"
#define alls(x) (x).begin(), (x).end()
#define fs first
#define sec second
#define bug(x) cerr << #x << " = " << x << endl
const int N = 5e5 + 10;
const int M = 1e6 + 10;
const int mod = 998244353;
const double eps = 1e-8;
const double PI = acos(-1.0);

int tree[N<<2];
void update(int x,int l,int r,int p,int v){
    if(l==r){
        tree[x]=v;
        return;
    }
    int mid=l+r>>1;
    if(p<=mid)update(x<<1,l,mid,p,v);
    else update(x<<1|1,mid+1,r,p,v);
    tree[x]=min(tree[x<<1],tree[x<<1|1]);
}
int query(int x,int l,int r,int ql,int qr){
    if(ql<=l&&r<=qr){
        return tree[x];
    }
    int res=1e9;
    int mid=l+r>>1;
    if(ql<=mid)res=min(res,query(x<<1,l,mid,ql,qr));
    if(qr>mid)res=min(res,query(x<<1|1,mid+1,r,ql,qr));
    return res;
}
ll inf=1e18;
void clear(int x,int l,int r){
	if(l==r){
		tree[x]=inf;
		return;
	}
	int mid=l+r>>1;
	clear(x<<1,l,mid);
	clear(x<<1|1,mid+1,r);
}
void solve(){
    int n;
    cin>>n;
    n++;
    clear(1,1,n);
    vector<int>a(n+1);
    for(int i=1;i<n;i++)cin>>a[i];
    a[n]=0;
    int m;
    cin>>m;
    vector<pair<int,int>>l(m);
    for(int i=0;i<m;i++){
        cin>>l[i].first>>l[i].second;
    }
    sort(l.begin(),l.end(),[&](auto x,auto y){
        if(x.second==y.second)return x.first<y.first;
        else return x.second<y.second;
    });
    vector<int>lst(n+1);
    int j=-1;
    int mn=0;
    int k=-1;
    for(int i=1;i<=n;i++){
        while(j+1<m&&l[j+1].second<i){
        	j++;
        	if(l[j].first>=mn){
        		mn=l[j].first;
        		k=j;
        	}
        }
        lst[i]=k;
        // cerr<<mn<<"\n"<<j<<"\n";
    }
    // for(int i=1;i<=n;i++)cerr<<lst[i]<<" ";
    // cerr<<"\n";
    vector<int>dp(n+1);
    for(int i=1;i<=n;i++){
		j=lst[i];
		if(j==-1)dp[i]=a[i];
		else dp[i]=query(1,1,n,l[j].first,l[j].second)+a[i];
    	// cerr<<i<<" "<<j<<" "<<dp[i]<< "!\n";
		update(1,1,n,i,dp[i]);
    	// cerr<<"^^\n";
    }
    // cerr<<"!!!!!!";
	cout<<dp[n]<<"\n";
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

//freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
//freopen("debug.txt", "w", stderr);
    int t=1;
    cin>>t; 
    while(t--)solve();
    return 0;
}