#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 + 10),now(n + m+ 10),pos(n + m + 10);
        vector <int> xi(m + n + 10),lst(n + m + 10),nxt(m + n + 10),fir(n + m+ 10);
        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;
        }
        set <pair<int,int>> s;
        for(int i=1;i<=n;i++) {
            s.insert(pair<int,int>(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(pair<int,int>(i,xi[i]))!=s.end()) {
                s.erase(pair<int,int>(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;
}