#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}
 
template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

const ld pi = 3.14159265358979323846;
const int mod = 998244353;
const ll INF = 1e18;

const int N = (int)1e5 + 1, M = N * 2;

bool cmp(vector<int> a, vector<int> b){
    return a[1] == b[1] ? a[0] < b[0] : a[1] < b[1];
}

int cnt = 0;

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

    int a[n + 1], r[n + 1];
    ll f[n + 1];
cnt++;
    string s = "";

    for(int i = 1; i <= n; i++){
        cin >> a[i];
        if(cnt == 25){
            s += to_string(a[i]) + " ";
        }
        f[i] = INF;
        r[i] = 0;
    }

    int m;
    cin >> m;

    
    vector<vector<int>> b(m, vector<int>(2));
    for(int i = 0; i < m; i++){
        cin >> b[i][0] >> b[i][1];
        if(cnt == 25){
            s += "(" + to_string(b[i][0]) + "," + to_string(b[i][1]) + ")"; 
        }
    }

if(cnt == 25) cout << s << endl;
    sort(b.begin(), b.end(), cmp);
    for(int i = 0, j = 0, k = 0; i <= n; i++){
        while(j < m && b[j][1] < i){
            k = chmax(k, b[j][0]);
            j++;
        }
        r[i] = k;
    }

    f[0] = 0;
    deque<int> q;
    q.push_back(0);

    for(int i = 1; i <= n; i++){
        while(!q.empty() && q.front() < r[i]){
            q.pop_front();
        }
        if(!q.empty()){
            f[i] = chmin(f[i], f[q.front()] + a[i]);
        }
        while(!q.empty() && f[q.back()] >= f[i]){
            q.pop_back();
        }
        q.push_back(i);
    }

    ll qwq = INF;
    for(int i = b[m - 1][0]; i <= b[m - 1][1]; i++){
        qwq = chmin(qwq, f[i]);
    }
    cout << qwq << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;

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