#include<bits/stdc++.h>
#define int long long
#define inf 0x3f3f3f3f3f3f3f 
#define GG ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define cnot cout<<"NO"<<"\n"
#define cyes cout<<"YES"<<"\n"
#define pb push_back
#define x0 first
#define y0 second
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef pair<int,string>Pis;
typedef pair<int,int>Pii;
const int N=2e5+10,mod=1e9+7,M=1e6+10;
struct node {
    int idx,num;
    bool operator<(const node&s)const{
        return idx>s.idx;
    }
};
int  b[N],vis[N],num1[N],id[N];
Pii l[N];
void solve(){
   int n,m;
   cin>>n>>m;
   for(int i=1;i<=m;i++){
    vis[i]=0;
    id[i]=0;   }
   for(int i=1;i<=n;i++){
        cin>>b[i];
        id[i]=0;

   }
   
    priority_queue<node>q;
    for(int i=1;i<=m;i++){
        cin>>l[i].x0>>l[i].y0;
    }
    sort(l+1,l+1+m);
    for(int i=1;i<=m;i++){
        vis[l[i].y0]++;
        if(vis[l[i].y0]==1){
            id[l[i].y0]=i;
            q.push({i,l[i].y0});
            num1[l[i].y0]=b[l[i].y0];
        }
    }

    int sum=0;
    for(int i=1;i<=n;i++){
        if(vis[i]==0){
            sum+=b[i];
        }
    }
    for(int i=1;i<=m;i++){
        int sum1=0;
        int mb=l[i].x0-l[i-1].x0;
        while(q.size()&&sum1<mb){
               auto t=q.top();
               q.pop();
               if(id[t.num]!=t.idx){
                continue;
               }
               sum1+=num1[t.num];
               if(sum1>mb){
                   num1[t.num]=(sum1-mb);
                   q.push(t); 
               }
               else {
                    num1[t.num]=0;
               }
               sum1=min(sum1,mb); 
        }
        if(!q.size()&&sum1<mb){
            if(sum+sum1<mb){
                cout<<l[i-1].x0+sum+sum1<<"\n";
                return ;
            }
            else {
                sum-=(mb-sum1);
            }
        }
        vis[l[i].y0]--;
        id[l[i].y0]=i;
        if(vis[l[i].y0]==0){
            id[l[i].y0]=-1;
            sum+=b[l[i].y0];
        }
        else {
        q.push({i,l[i].y0});
        num1[l[i].y0]=b[l[i].y0];
        }
        //cout<<sum<<" ";
    }
    int ans=l[m].x0;
    ans+=sum;
    cout<<ans<<"\n";
}
signed main(){
    GG;
    int _t=1;
    cin>>_t;
    while(_t--){
        solve();
    }
    
}