#include<bits/stdc++.h>

#define ll long long 
#define pb push_back
#define ff first
#define ss second
#define ld long double

using namespace std;

int main(){
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);

    int tt; cin >> tt;
    while (tt--) {
        int n, m; cin >> n >> m;
        vector<int> a(n), d(m+1), b(m+1);

        vector<vector<int>> c(n, vector<int>());

        for (int i=0; i<n; ++i) cin >> a[i];
        vector<int> charge = a;
        for (int i=1; i<=m; ++i) {
            cin >> d[i] >> b[i];
            b[i]--;

            c[b[i]].pb(i);
        }
        for (int i=0; i<n; ++i) reverse(c[i].begin(), c[i].end());
        set<pair<int, int>> s;
        for (int i=0; i<n; ++i) {
            int p = c[i].size() ? c[i].back() : m; 
            s.insert({p, i});
        }

        ll ans = 0;
        for (int i=1; i<=m; ++i) {
            int rem = d[i] - d[i-1];
            while (s.size() && rem) {
                pair<int, int> cur = *s.begin();
                s.erase(s.begin());
                //cout << cur.ss << ' ' << rem << ' ' << charge[cur.ss] << endl;

                int mn = min(charge[cur.ss], rem);
                rem -= mn;
                charge[cur.ss] -= mn;
                ans += mn;

                if (charge[cur.ss]) s.insert(cur);
            }

            if (rem) break;

            if (s.count({i, b[i]})) s.erase({i, b[i]});

            c[b[i]].pop_back();
            charge[b[i]] = a[b[i]];

            if (c[b[i]].size()) s.insert({c[b[i]].back(), b[i]});
            else s.insert({m, b[i]});
        }

        while (s.size()) {
            ans += charge[s.begin()->ss];
            s.erase(s.begin());
        }
        cout << ans << '\n';
    }
    return 0;
}