#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
typedef long long ll;
int w[N],num[N];
struct cc
{
    int x,id;
}a[N];
bool cmp(cc x,cc y)
{
    return x.x<y.x;
}
int main()
{
    int T,n,m;
    cin>>T;
    while(T--)
    {
        a[0].x=0;
        memset(num,0,sizeof(num));
        ll fr=0,r=0;
        cin>>n>>m;
        for(int i=1;i<=n;i++)
            {cin>>w[i];fr+=w[i];}
        for(int i=1;i<=m;i++)
        {
            cin>>a[i].x>>a[i].id;
            if(num[a[i].id]==0)r+=a[i].x;
            num[a[i].id]++;
        }
        fr-=r;
        int ids=1;
        ll _r=r,st=0;
        sort(a+1,a+m+1,cmp);
        //int nn=0;
        while(r+fr>=a[ids].x-a[ids-1].x&&ids<=m)
        {
            //nn++;
            //cout<<r+fr<<endl;
            ll t=a[ids].x-a[ids-1].x;
            //cout<<t<<endl;
            if(r>=t)
            {
                r-=t;
                r=min(r+w[a[ids].id],_r);
            }
            else {
                r=w[a[ids].id];
                fr-=(t-r);
            }
            num[a[ids].id]--;
            if(num[a[ids].id]==0) {_r-=w[a[ids].id];r-=w[a[ids].id];fr+=w[a[ids].id];}
            st=a[ids++].x;
        }
        cout<<st+fr+r<<endl;
    }
    return 0;
}