#include<bits/stdc++.h>
using namespace std;
#define int long long
int const maxn = 5e5 + 10;
int const inf = 1e9+10;

struct node {
	int l,r;
	
}p[maxn];

bool cmp(node a,node b){
	if(a.r==b.r){
		return a.l<b.l;
	}else return a.r < b.r;
}
int a[maxn];
int f[maxn];
int q[maxn];
int pre[maxn];

signed main(){
	int t;
	cin >> t ;
	while(t--){
	 	int n;
	 	memset(f,0,sizeof f);
	    memset(pre,0,sizeof pre);
		memset(q,0,sizeof q);
		cin >> n;
	    for(int i = 1;i <= n;i ++){
	    	cin >> a[i];
	    }
	    int m;
	    cin >> m ;
	    for(int i = 1;i <= m;i ++){
	    	cin >> p[i].l>>p[i].r;
	    	pre[p[i].r] = max(pre[p[i].r],p[i].l);
	    }
	    sort(p+1,p+m+1,cmp);
	    int l = 1,r = 1;
	   
	    q[l] = 0;
	    
	    for(int i = 1;i <= n;i ++){
	    	f[i] = f[q[l]] + a[i];
	    	while(l <=	 r&&f[q[r]] > f[i])r--;
	    	q[++r] = i;
	    	while(q[l] < pre[i]){
	    		l ++;
	    	}
	    }
	    
	    cout << f[n] <<'\n';
	}
	return 0;
    
	 	
}