#include <bits/stdc++.h>
using namespace std;
using ll=long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<class... Args> void _(Args... args) {
    auto print = [&](auto x) { cout << x << " "; };
    cout << "--->";
    int arr[] = {(print(args), 0)...};
    cout << "\n";
}
void Solve() {
    int n,m;ll sum=0;cin>>n>>m;
    vector<int> a(n+1),his(n+1);
    for(int i=1;i<=n;i++) cin>>a[i],sum+=a[i];
    set<array<int,2>> st;
    vector<array<int,2>> site(m+1);
    for(int i=1;i<=m;i++) {
        cin>>site[i][0]>>site[i][1];
        if(sum<site[i][0]) {
            break;
        }
        st.insert({site[i-1][0]+1,site[i][0]});
        ll s=site[his[site[i][1]]][0]+1;
        ll ener=a[site[i][1]];
        while (true) {
            auto iter=st.lower_bound({s,0});
            auto [fi,se]=*iter;
            st.erase(iter);
            int deta=se-fi+1;
            if(deta>ener) {
                sum+=ener;
                st.insert({fi+ener,se});
                break;
            }
            sum+=deta;ener-=deta;
            if(se==site[i][0]) {
                break;
            }
            his[site[i][1]]=i;
        }
    }
    cout<<sum<<endl;
}

signed main() {
    int Task = 1;
    cin >> Task;
    while (Task--) Solve();
}