#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
#define LF(x) fixed<<setprecision(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;

void solve()
{
	int n;
	cin>>n;
	vector<int>a(n+2);
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	// a[++n]=0;
	int m;
	cin>>m;
	vector<int>l(m+1),r(m+1);
	vector<int>L(n+1);
	for(int i=1;i<=m;i++){
		cin>>l[i]>>r[i];
		L[r[i]]=max(l[i],L[r[i]]);
	}
	vector<ll>dp(n+1,INF);
	deque<int>dq;
	dq.push_back(0);
	dp[0]=0;
	for(int i=1;i<=n;i++){
		dp[i]=min(dp[i],dp[dq.front()]+a[i]);
		while(!dq.empty()&&dp[dq.back()]>dp[i])dq.pop_back();
		dq.push_back(i);
		while(!dq.empty()&&dq.front()<L[i])dq.pop_front();
	}
	cout<<dp[n]<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}