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

using i64 = long long;

void modify(vector<int> &tr, int N, int p, int x) {
    tr[N + p] = x;
    for(int i = (N + p) / 2; i; i /= 2)
        tr[i] = min(tr[i * 2], tr[i * 2 + 1]);
}

int find(vector<int> &tr, int N) {
    int i = 1;
    while(i < N) {
        i *= 2;
        if(tr[i] > tr[i + 1]) i ++;
    }
    return i - N;
}

i64 solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b;
    for(auto &x : a) cin >> x;
    b = a;

    int L = 1;
    while(L < n) L <<= 1;
    vector<int> tr(L * 2, INT_MAX - 1);

    vector<vector<int> > p(n);
    vector<pair<int, int> > gs(m);
    for(auto &[x, t] : gs)
        cin >> x >> t;
    reverse(gs.begin(), gs.end());
    for(auto &[x, t] : gs) {
        t --;
        p[t].push_back(x);
    }
    for(int i = 0; i < n; i ++) 
        if(p[i].size())
            modify(tr, L, i, p[i].back());
    i64 ans = 0;
    while(true) {
        int i = find(tr, L);
        //cout << "tr: ";
        //for(int x : tr) cout << x << " ";
        //cout << "\n";
        //cout << ans << " -> " << i << "\n";
        if(b[i] <= 0) return ans;

        if(gs.size() && gs.back().first <= ans + b[i]) {
            auto [x, t] = gs.back();
            gs.pop_back();
            
            b[i] -= x - ans;
            ans = x;
            if(b[i] == 0) modify(tr, L, i, INT_MAX);

            b[t] = a[t];
            p[t].pop_back();
            modify(tr, L, t, p[t].size() ? p[t].back() : INT_MAX - 1);
        }else{
            ans += b[i];
            b[i] = 0;
            modify(tr, L, i, INT_MAX);
        }
    }
    return ans;
}

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

    int T;
    cin >> T;
    while(T --)
        cout << solve() << "\n";
}