#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
const ll N=1e5+10;
const ll INF=1e18+10;
ll n,m;
ll a[N],x[N],t[N];
ll now[N];
vector<ll>charge[N];
ll pt[N];
void solve(){
    cin>>n>>m;
    for(ll i=1;i<=n;++i){
        a[i]=now[i]=0;
        charge[i].clear();
        pt[i]=0;
    }
    for(ll i=1;i<=n;++i){
        cin>>a[i];
        now[i]=a[i];
    }
    for(ll i=1;i<=m;++i){
        cin>>x[i]>>t[i];
        charge[t[i]].push_back(x[i]);
    }
    ll ans=0;
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>q;
    for(ll i=1;i<=n;++i){
        if(charge[i].size())q.push({x[0],i});
        else q.push({INF,i});
    }
    // for(ll i=1;i<=m;++i){
    //     q.push({x[i],t[i]});
    // }
    for(ll i=1;i<=m;++i){
        while(x[i]>ans&&q.size()){
            pair<ll,ll>p=q.top();q.pop();
            ll tmp=min(x[i]-ans,now[p.second]);
            now[p.second]-=tmp;
            ans+=tmp;
            if(now[p.second])q.push(p);
        }
        if(ans<x[i])break;
        now[t[i]]=a[i];
        pt[t[i]]++;
        if(pt[t[i]]<charge[t[i]].size()){
            q.push({charge[t[i]][pt[t[i]]],t[i]});
        }else {
            q.push({INF,t[i]});
        }
    }
    for(ll i=1;i<=n;++i)ans+=now[i];
    cout<<ans<<endl;


}
signed main(void){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    ll Times=1;
    cin>>Times;
    while(Times--)solve();
    return 0;
}