#include <bits/stdc++.h>
using namespace std;
#define all(x, y) x.begin() + y, x.end()
#define mkp make_pair
#define pii pair<int, int>
#define pil pair<int, long long>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(name, base, limit) for(int name = base; name <= limit; ++name)
#define per(name, base, limit) for(int name = base; name >= limit; --name)
#define lowbit(x) ((x) & -(x))
#define ls(p) ((p) << 1)
#define rs(p) ((p) << 1 | 1)
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;

inline long long read()
{
    long long x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
    return x*f;
} 

/*
f[i]表示包含i以及其i的左侧的区间内, 最小的cost
设j为i左侧第一个不包含i的r, k为i左侧的第一个包含i的区间的l
如不存在区间, k = 0
对j和k分类讨论
对于j < k的情况, f[i] = min(f[j] + min(w[k ~ i]));
对于j >= k的情况, f[i] = f[j]
*/
const int LGN = 500000;
int lg2[LGN + 1];
//don't forget init value of log2 and calculate function
void lginit()
{
    rep(i, 2, LGN) lg2[i] = lg2[i / 2] + 1;
}
struct ST
{
    vector<vector<ll>> st;
    ll cal(ll x, ll y)
    {
        ll ret = min(x, y);
        return ret;
    }
    void init(vector<ll> a, int n)
    {
        st.resize(n + 1);
        rep(i, 0, n) st[i].resize(31), st[i][0] = a[i];
        rep(i, 1, 20) for (int j = 1; j + (1 << i) - 1 <= n; ++j)
        st[j][i] = cal(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
    }
    ll query(int l, int r)
    {
        int s = lg2[r - l + 1];
        return cal(st[l][s], st[r - (1 << s) + 1][s]);
    }
};

void solve()
{
    int n = read();
    vector<ll> a(n + 1);
    rep(i, 1, n) a[i] = read();
    ST st;
    st.init(a, n);
    vector<ll> f(n + 1);
    int m = read();
    vector vl(n + 1, vector<int>()), vr(n + 1, vector<int>());
    vector<int> l(m + 1), r(m + 1);
    rep(i, 1, m)
    {
        l[i] = read(), r[i] = read();
        vl[l[i]].pb(i), vr[r[i]].pb(i);
    }
    int lstr = 0;
    multiset<int> lstl;
    // set<int> now;
    rep(i, 1, n)
    {
        for (auto x: vl[i])
        {
            // now.insert(x);
            lstl.insert(l[x]);
        }
        if (lstl.empty()) f[i] = f[lstr];
        else
        {
            int k = *lstl.rbegin();
            if (k <= lstr) f[i] = f[lstr];
            else f[i] = f[lstr] + st.query(k, i);
        }
        for (auto x: vr[i])
        {
            lstr = i;
            lstl.erase(lstl.lower_bound(l[x]));
        }
    }
    cout << f[n];
}

int main()
{
    lginit();
    int t = read();
    while (t--)
    {
        solve();
        if (t) putchar('\n');
    }
    return 0;
}