#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define lowbit(x) (x)&(-x)
//#define int long long
//#define double long double 
const int N = 2e5 + 5;
const ll base = 131;
const ll mod = 998244353;
void solve() {
    int n, m;
    cin >> n >> m;
    vector<int>a(n + 1), b(n + 1);
    ll sum = 0;
    for (int i = 1; i <= n; ++i) cin >> a[i], sum += a[i], b[i] = a[i];
    vector<pair<int, int>>w(m + 1);
    vector<set<int>>h(n + 1);
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>q;
    for (int i = 1; i <= m; ++i) {
        cin >> w[i].first >> w[i].second;
        h[w[i].second].insert(w[i].first);
    }
    for (int i = 1; i <= n; ++i) {
        if (h[i].empty()) q.push({ 2e9,i });
        else q.push({ *h[i].begin(),i });
    }
    ll now = 0;
    //cerr<<now<<'\n';
    //cerr<<q.size()<<'\n';0
    for (int i = 1; i <= m; ++i) {
        ll sum = 0;
        while (!q.empty()) {
            auto u = q.top().first;
            auto v = q.top().second;
            if (sum + now + b[v] < w[i].first) {
                sum += b[v];
                b[v] = 0;
                q.pop();
                //cerr<<v<<'\n';
                continue;
            }
            else {
                b[v] -= (w[i].first - sum - now);
                now = w[i].first;
                if (v == w[i].second) q.pop();
                //cerr<<v<<'\n';
                break;
            }
        }
        if (now != w[i].first) {
            //cerr<<i<<'\n';
            break;
        }
        else {
            b[w[i].second] = a[w[i].second];
            h[w[i].second].erase(h[w[i].second].begin());
            if (!h[w[i].second].empty()) q.push({ *h[w[i].second].begin(),w[i].second });
            //if(q.top().second==w[i].second) q.pop();
        }
    }
    //cerr<<1<<'\n';
    //cerr<<now<<'\n';
    //cerr<<q.size()<<'\n';
    for (int i = 1; i <= n; ++i) {
        //cerr << b[i] << " ";
        now += b[i];
    }
    cout << now << '\n';


}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
}