#include<bits/stdc++.h>
#define LL long long
#define P pair<int,int>
#define fi first
#define se second
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e6+5;const LL inf=4e18;
int T,n,m,a[N],l[N];LL b[N<<2],f[N];
void updata(int l,int r,int wz,int p,LL x)
{
	if(l==r) return b[wz]=min(b[wz],x),void();int mid=(l+r)>>1;
	if(p<=mid) updata(l,mid,wz<<1,p,x);
	else updata(mid+1,r,wz<<1|1,p,x);b[wz]=min(b[wz<<1],b[wz<<1|1]);
}
LL query(int l,int r,int wz,int L,int R)
{
	if(L<=l&&r<=R) return b[wz];int mid=(l+r)>>1;LL ans=inf;
	if(L<=mid) ans=min(ans,query(l,mid,wz<<1,L,R));
	if(mid<R) ans=min(ans,query(mid+1,r,wz<<1|1,L,R));return ans;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
	while(T--)
	{
		cin>>n;a[n+1]=l[n+1]=0;
		for(int i=1;i<=n;i++) cin>>a[i],l[i]=0;cin>>m;
		for(int i=1,x,y;i<=m;i++)
		{
			cin>>x>>y,l[y]=max(l[y],x);
		}
		for(int i=1;i<=n+1;i++) l[i]=max(l[i-1],l[i]);
		fill(b+1,b+1+((n+5)<<2),inf);updata(1,n+1,1,1,0);
		for(int i=1;i<=n+1;i++)
		{
			int pre=l[i-1],r=i-1;
			f[i]=query(1,n+1,1,pre+1,r+1)+a[i];
			if(i!=n+1) updata(1,n+1,1,i+1,f[i]);
			// cout<<f[i]<<" ";
		}cout<<f[n+1]<<"\n";
	}
	return 0;
}