#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    ios::sync_with_stdio(false),cout.tie(nullptr),cin.tie(nullptr);
    auto solve=[&]() {
        int n,m;
        cin >> n >> m;
        vector <int> a(n +m+1),now(n + m + 1),pos(n + m + 1);
        vector <int> xi(n + m + 1),lst(m + n + 1),nxt(n+m + 1),fir(n+m + 1);
        for(int i=1;i<=n;i++) cin >> a[i],now[i] = a[i];
        for(int i=1;i<=m;i++) cin >> pos[i] >> xi[i];
        for(int i=1;i<=n;i++) fir[i] = m + 1,lst[i] = 0;
        for(int i=1;i<=m;i++) {
            if( fir[xi[i]] > m ) fir[xi[i]] = i;
            if(lst[xi[i]]) nxt[lst[xi[i]]] = i;
        }
        for(int i=1;i<=n;i++) {
            if(lst[i]) nxt[lst[i]] = m + 1;
        }
        set <pair<int,int>> s;
        for(int i=1;i<=n;i++) {
            s.insert({fir[i],i});
        }
        int sum = 0;
        for(int i=1;i<=m;i++) {
            int r = pos[i] - pos[i-1];
            while(!s.empty() && now[s.begin()->second] <=r) {
                int k = s.begin()->second;
                sum += now[k];
                r -= now[k];
                now[k] = 0;
                s.erase(s.begin());
            }
            if(s.empty() && r > 0) {
                cout << sum << "\n";
                return;
            }
            now[s.begin()->second] -= r;
            sum += r;
            now[xi[i]] = a[xi[i]];
            if(s.find({i,xi[i]})!=s.end()) {
                s.erase({i,xi[i]});
            }
            s.insert({nxt[i],xi[i]});
        }
        for(int i=1;i<=n;i++) sum += now[i];
        cout << sum << "\n";

    };
    int t = 1;
    cin>>t;
    while(t--) {
       solve();
    }
    return 0;
}