#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define sq(a) ((a)*(a))

#define per(i,a,b) for (int i = (b)-1; i >= a; i--)
#define rep(i,a,b) for (int i=a; i<b; i++)

#define FOR(i,a,b) for (int i=a; i<b; i++)
#define F0R(i,a) for (int i=0; i<a; i++)
#define ROF(i,a,b) for (int i = (b)-1; i >= a; i--)
#define R0F(i,a) for (int i = (a)-1; i >= 0; i--)

#define FAST ios::sync_with_stdio(0); cin.tie(0);
#define finish(x) return cout << x << endl, 0;
#define dbg(x) cerr << ">>> " << #x << " = " << x << endl;
#define _ << " _ " <<

#define ll long long

template<class T> bool ckmin(T&a, T&b) { bool B = a > b; a = min(a,b); return B; }
template<class T> bool ckmax(T&a, T&b) { bool B = a < b; a = max(a,b); return B; }

typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ld,ld> pld;
typedef complex<ld> cd;

typedef vector<int> vi;
typedef vector<ld> vld;
typedef vector<vector<int>> vvi;


const ld PI = acos(-1.0);
const ld EPS = 1e-7;
const int MOD = 998244353;


struct Tree {
	typedef ll T;
	static constexpr T unit = 1e17;
	T f(T a, T b) { return min(a, b); } // (any associative fn)
	vector<T> s; int n;
	Tree(int n = 0, T def = unit) : s(2*n, def), n(n) {}
	void update(int pos, T val) {
		for (s[pos += n] = val; pos /= 2;)
			s[pos] = f(s[pos * 2], s[pos * 2 + 1]);
	}
	T query(int b, int e) { // query [b, e)
		T ra = unit, rb = unit;
		for (b += n, e += n; b < e; b /= 2, e /= 2) {
			if (b % 2) ra = f(ra, s[b++]);
			if (e % 2) rb = f(s[--e], rb);
		}
		return f(ra, rb);
	}
};

void solve() {
  int n;
  cin >> n;

  vi a(n);
  F0R(i, n) {
    cin >> a[i];
  }

  vi rev(n + 1, 0);
  int m; cin >> m;

  F0R(i, m) {
    int li, ri;
    cin >> li >> ri;
    rev[ri] = max(rev[ri], li);
  }

  F0R(i, n){
    rev[i + 1] = max(rev[i + 1], rev[i]);
  }

  vector<long long> dp(n + 1, 0);
  Tree seg(n + 1, 1e17);
  seg.update(0, 0);
  FOR(i, 1, n + 1){
    ll base = a[i - 1] + seg.query(rev[i - 1], i);
    // cout << i << " " << rev[i - 1] << " " << base << '\n';
    dp[i] = base;
    seg.update(i, base);
  }

  cout << dp[n] << '\n';
}

int32_t main() { FAST
  int t;
  cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}