#include<bits/stdc++.h>
using namespace std;
#define int long long

int n,a[500100],m,l[500100],r[500100],cnt,tr[500100*4];
bool ok[500100];
int ans=0;

void build(int id,int l,int r){
	if(l==r){
		tr[id]=a[l];
		return;
	}
	int mid=(l+r)/2;
	build(id*2,l,mid);
	build(id*2+1,mid+1,r);
	tr[id]=min(tr[id*2],tr[id*2+1]);
//	cout<<id<<" "<<tr[id]<<endl;
}

int query(int id,int l,int r,int ql,int qr){
	if(ql<=l&&r<=qr){
		return tr[id];
	}
	int mid=(l+r)/2;
	int w1=1e9+10,w2=1e9+10;
	if(ql<=mid) w1=query(id*2,l,mid,ql,qr);
	if(qr>mid) w2=query(id*2+1,mid+1,r,ql,qr);
	return min(w1,w2);
}

signed main(){
	int t;cin>>t;
	while(t--){
		cin>>n;cnt=0;ans=0;
		a[0]=1e9+10;
		for(int i=1;i<=n;i++) {
			cin>>a[i];
		}
		build(1,1,n);
		cin>>m;
		for(int i=1;i<=m;i++) {
			cin>>l[i]>>r[i];
		}
		l[m+1]=n+100;
		for(int i=1;i<=m;i++){
			int w=0,w1=0,w2=0,idd=0;
			if(r[i]>=l[i+1]){
			//	cout<<i<<" "<<"done1"<<endl;
				w=query(1,1,n,max(l[i],l[i+1]),min(r[i],r[i+1]));
				if(i<m){
					w1=query(1,1,n,l[i],r[i]);
					w2=query(1,1,n,l[i+1],r[i+1]);
				}else{
					w1=1e9,w2=1e9;
				}	
				if(w1+w2<=w){
					ans+=w1;
				}else{
					ans+=w;
					i++;
				}
			}else{
			//	cout<<i<<" "<<"done2"<<endl;
				idd=query(1,1,n,l[i],r[i]);
				ans+=idd;
			} 
		//	cout<<idd<<" "<<w1<<" "<<w2<<" "<<w<<endl;
		}
		cout<<ans<<endl;
		 
	}
	
	
	return 0;
}