#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using u64=unsigned long long;
#define ll long long
const int inf=1e9;
const ll inff=1e18;
using i128=__int128;

void solve(){
    int n,m;
    cin>>n>>m;
    vector<i64> a(n),b(n),x(m),t(m);
    for(int i=0;i<n;i++){
        cin>>a[i];
        b[i]=a[i];
    }
    priority_queue<pair<i64,i64>,vector<pair<i64,i64>>,greater<pair<i64,i64>>> q;
    for(int i=0;i<m;i++){
        cin>>x[i]>>t[i];
        t[i]--;
    }
    vector<i64> nxt(m),mp(n,m);
    for(int i=m-1;i>=0;i--){
        nxt[i]=mp[t[i]];
        mp[t[i]]=i;
    }
    for(int i=0;i<n;i++){
        q.push({mp[i],i});
    }
    i64 ans=0ll,k=0;
    while(!q.empty()){
        auto [pos,id]=q.top();
        q.pop();
        i64 dis=x[k]-ans;
        if(k<m && a[id]>dis){
            a[id]-=dis;
            ans+=dis;
            a[t[k]]=b[t[k]];
            q.push({nxt[k],t[k]});
            if(id!=t[k]){
                q.push({pos,id});
            }
            k++;
        }else{
            ans+=a[id];
            a[id]=0;
        }
    }
    cout<<ans<<'\n';
}

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