#include <bits/stdc++.h>

using namespace std ;

typedef long long ll ;
typedef pair<int , int> PII ;
const int N = 500010 ;
const ll inf = 1e17 ;
int n , a[N] , T , m , mx ;
ll dp[N] ;
PII b[N] ;
vector<int> c[N] ;
set<int> s ;

ll val[N * 4] ;

void build(int p , int l , int r) {
    val[p] = inf ;
    if(l == r) {
        return ;
    }
    int mid = (l + r) >>1 ;
    build(p * 2 , l, mid) ;
    build(p * 2 + 1 , mid + 1, r) ;
    return ;
}

void change(int p , int l , int r , int x , ll v) {
    if(l == r) {
        val[p] = v ;
        return ;
    }
    int mid = (l + r) >> 1;
    if(x <= mid) change(p * 2 , l , mid , x , v) ;
    else change(p * 2 + 1 , mid + 1 , r , x , v) ;
    val[p] = min(val[p * 2] , val[p * 2 + 1]) ;
}

ll query(int p , int l , int r , int ql , int qr) {
    if(ql == 0 || qr == 0) return 0 ;
    if(ql <= l && r<= qr) {
        return val[p] ;
    }
    ll res = inf ; int mid = (l + r) >> 1 ;
    if(ql <= mid) res = min(res , query(p * 2 , l , mid , ql , qr)) ;
    if(qr > mid) res = min(res , query(p * 2 + 1 , mid + 1 , r , ql , qr)) ;
    return res ;
}

int main() {
    cin >> T ;
    while(T --) {
        scanf("%d" , &n) ;
        for(int i = 1 ; i <= n ; i ++) scanf("%d" , &a[i]) ;
        scanf("%d" , &m) ;
        for(int i = 1 ; i <= m ; i ++) scanf("%d%d" , &b[i].first , &b[i].second) ;
        sort(b + 1 , b + m + 1) ;
        for(int i = 1 ; i <= m ; i ++) {
            c[b[i].second].push_back(b[i].first) ;
        }
        mx = 0 ; build(1 , 0 , n) ; change(1 , 0 , n , 0 , 0) ;
        for(int i = 1 ; i <= n ; i ++) {
            dp[i] = query(1 , 0 , n , mx , i - 1) + a[i] ;
            change(1 , 0 , n , i , dp[i]) ;
            for(auto x : c[i]) {
                mx = max(mx , x) ;
            }
        }   
        ll res = inf ;
        for(int i = b[m].first ; i <= b[m].second ; i ++) {
            res = min(res , dp[i]) ;
        }
        printf("%lld\n" , res) ;
    }
    return 0 ;
}