#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5+7,mod=1e9+7,INF=1e15;

struct Node{
	ll mn = INF;
};
struct SegmentTree{
	vector<Node>t;
	SegmentTree(int n) {
		t.resize(n << 5);
	}
	void modify(int p, int l, int r, int x, ll d) {
		if(l == r) {
			t[p].mn = d;
			return;
		}
		int mid = (l + r) >> 1;
		if(x <= mid) modify(p << 1, l, mid, x, d);
		else modify(p << 1 | 1, mid + 1, r, x, d);
		t[p].mn = min(t[p << 1].mn, t[p << 1 | 1].mn);
	}
	ll query(int p, int l , int r, int ql, int qr) {
		if(ql <= l && qr >= r) {
			return t[p].mn;
		}
		ll ans = INF, mid = (l + r) >> 1;
		if(ql <= mid) {
			ans = query(p << 1, l, mid, ql, qr);
		}
		if(qr > mid) {
			ans = min(ans, query(p << 1 | 1, mid + 1, r, ql, qr));
		}
		return ans;
	}
	
};

void solve(){
	int n, m;
	cin >> n;
	vector<ll>a(n + 1);
	for(int i = 1; i <= n; i++) cin >> a[i];
	cin >> m;
	map<ll, ll>mp;
	ll mxl = 0;
	for(int i = 1; i <= m; i++) {
		ll l, r; cin >> l >> r;
		mp[r] = max(mp[r], l);
//		mxl = max(mxl, l);
	}
	SegmentTree seg(n + 1);
	ll ans;
	for(int i = 1; i <= n; i++) {
		if(!mxl) ans = 0;
		else ans = seg.query(1, 1, n ,mxl, i);
		if(mp.find(i) != mp.end()) mxl = max(mp[i], mxl);
		seg.modify(1, 1, n, i, ans + a[i]);
	}
	ans = INF;
	for(int i = mxl; i <= n; i++) ans = min(ans, seg.query(1, 1, n, i, i));
	cout << ans << "\n";
	
	
}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	ll T=1;
	
	cin>>T;
	
	while(T--){
		solve();
	}
	return 0;
}