#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.l==b.l){
		return a.r<b.r;
	}else return a.l < b.l;
}
int a[maxn];

int f[maxn];
signed main(){
	int t;
	cin >> t ;
	while(t--){
	 	int n;
	 	memset(f,0,sizeof f);
	    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;
	    }
	    sort(p+1,p+m+1,cmp);
	    
	    for(int i = 1;i <= m;i ++){
	    	int tmp = inf;
			for(int j = p[i].l;j <= p[i].r;j ++){
	    		if(f[j]){
	    			tmp = min(f[j],tmp);
	    		}
	    	}
	    	int minn = p[i].l;
	    	if(tmp == inf){
	    		for(int j = p[i].l;j <= p[i].r;j ++){
	    			if(a[j] < a[minn]){
	    				minn = j;
	    			}
	    		}
	    	}
	    	f[minn] = a[minn];
	    }
	    int ans = 0;
	    for(int i = 1;i <= n;i ++){
	    	ans += f[i];
	    }
	    cout << ans <<'\n';
	}
    
	 	
}