#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<unordered_map>
#include<vector>
#include<bitset>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<numeric>
using namespace std;
#define int long long
#define ll long long
#define ull unsigned long long
#define lc (x<<1)
#define rc (x<<1|1)
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
#define cout (cerr<<">> ",cout)
const int Mx=500005,p=998244353;
int read(){
	char ch=getchar();
	int Alice=0,Aya=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-') Aya=-Aya;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		Alice=(Alice<<3)+(Alice<<1)+(ch^48),ch=getchar();
	return (Aya==1?Alice:-Alice);
}
int n,m;
int cost[Mx];
struct Seg{
	int l,r;
	bool operator <(const Seg&o)const{
		return l==o.l?r<o.r:l<o.l;
	}
}a[Mx],c[Mx];
int f[Mx];
int t[Mx];
void Ins(int i,int k){
	for(;i<=m+1;i+=(i&-i)) t[i]=min(t[i],k);
}
int Qry(int i){
	int res=1e18;
	for(;i;i&=(i-1)) res=min(res,t[i]);
	return res;
}
void Solve(){
	n=read();
	for(int i=1;i<=n;i++) cost[i]=read();
	m=read();
	for(int i=0;i<=m+1;i++) t[i]=1e18;
	for(int i=1;i<=m;i++){
		a[i].l=read(),a[i].r=read();
	}
	sort(a+1,a+m+1);
	int M=1;
	for(int i=2;i<=m;i++){
		if(a[i].r<=a[M].r) a[M]=a[i];
		else a[++M]=a[i];
	}
	m=M;
	int ans=1e18;
	Ins(m+1,0);
	for(int i=1;i<=n;i++){
		int L=1,R=m,ok=-1;
		while(L<=R){
			int mid=((L+R)>>1);
			if(a[mid].r>=i) R=mid-1,ok=mid;
			else L=mid+1;
		}
		c[i].l=ok;
		L=1,R=m,ok=-1;
		while(L<=R){
			int mid=((L+R)>>1);
			if(a[mid].l<=i) L=mid+1,ok=mid;
			else R=mid-1;
		}
		c[i].r=ok;
		//cout<<c[i].l<<" "<<c[i].r<<endl;
		if(c[i].l==-1||c[i].r==-1){
			f[i]=1e18;
			continue;
		}
		int res=1e18;
		for(int j=0;j<i;j++){
			if(c[j].r+1>=c[i].l) res=min(res,f[j]);
		}
		f[i]=Qry(m+2-c[i].l)+cost[i];
		Ins(m+2-(c[i].r+1),f[i]);
		if(c[i].r==m) ans=min(ans,f[i]);
	}
	printf("%lld\n",ans);
}
signed main(){
	int T=read();
	while(T--) Solve();
	return 0;
}
/*
Hello!!
Sample:

-------------------
*/