#include<bits/stdc++.h>
using namespace std;
const int N=5e5+10;
int a[N];
struct A
{
	int l,r;
}b[N];
int n,m;
bool ss(A t1,A t2)
{
	return t1.r<t2.r;
}
long long dp[N];
int que[N],l,r;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		l=1,r=2;
		que[1]=0;
		cin>>n;
		for(int i=1;i<=n;i++) cin>>a[i];
		cin>>m;
		for(int i=1;i<=m;i++) cin>>b[i].l>>b[i].r;
		sort(b+1,b+m+1,ss);
		int now=1;
		dp[0]=0;
		a[n+1]=0;
		for(int i=1;i<=n+1;i++) dp[i]=-1;
		int mxl=0;
		for(int i=1;i<=n+1;i++)
		{
			dp[i]=dp[i-1]+a[i];
			while(now<=m&&b[now].r<i)
			{
				mxl=max(mxl,b[now].l);
				now++;
			}
			while(l<r&&que[l]<mxl) l++;
			dp[i]=dp[que[l]]+a[i];
			while(l<r&&dp[que[r-1]]>dp[i])
				r--;
			que[r]=i;
			r++;
		}
		cout<<dp[n+1]<<endl;
	}
	return 0;	
}