#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m,t,w[500005],mn[500005],f[500005],res,ml;
struct node{
	int l,r;
	friend bool operator<(node a,node b){
		return a.r<b.r;
	}
}p[500005];
vector<int>rs[500005];
deque<int>q;
signed main(){
	cin>>t;
	while(t--){
		cin>>n;
		for(int i=1;i<=n;i++)scanf("%lld",&w[i]);
		cin>>m;
		ml=0;
		for(int i=1;i<=n;i++)rs[i].clear();
		for(int i=1;i<=m;i++){
			scanf("%lld%lld",&p[i].l,&p[i].r);
			rs[p[i].r].push_back(p[i].l);
			ml=max(ml,p[i].l);
		}
		memset(f,0x3f,sizeof(f));
		f[0]=0;res=1e18;
		sort(p+1,p+m+1);
		mn[0]=0;
		q.clear();
		q.push_back(0);
		for(int i=1;i<=n;i++){
            while(q.size()&&q.front()<mn[i-1])q.pop_front();
            f[i]=f[q.front()]+w[i];
            while(q.size()&&f[q.back()]>f[i])q.pop_back();
            q.push_back(i);
			mn[i]=mn[i-1];
			for(int j=0;j<rs[i].size();j++){
				mn[i]=max(mn[i],rs[i][j]);
			}
			if(i>=ml)res=min(res,f[i]);
		}
		printf("%lld\n",res);
	}
}