#include<bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int N=1e5+10;

struct node
{
    ll num,len;
    bool operator< (const node &a)const
    {
        return len>a.len;
    }
};

ll a[N];
ll ora[N];
priority_queue<node> q;
queue<node> f;
queue<int> que[N];

void solve()
{
    int i,j,n,m;
    cin>>n>>m;
    set<node> se;
    while(!q.empty())
        q.pop();
    while(!f.empty())
        f.pop();
    For(i,1,n)
        while(!que[i].empty())
            que[i].pop();

    For(i,1,n)
        cin>>a[i],ora[i]=a[i];

    For(i,1,m)
    {
        node x;
        cin>>x.len>>x.num;
        q.push(x);
        se.insert(x);
        f.push(x);
        que[x.num].push(x.len);
    }

    ll sum=0;
    For(i,1,n)
    {
        if(que[i].empty())
        {
            sum+=a[i];
            a[i]=0;
        }
    }
    ll ans=0;

    while(!f.empty()){
        if(!q.empty()){
            node x=q.top(),y=f.front();
            while(ans+a[x.num] < y.len){
                ans+=a[x.num],a[x.num]=0,q.pop(),se.erase(x);
                if(q.empty()) break;;
                x=q.top();
            }
            if(!q.empty()){
                a[x.num]-=y.len-ans;
                ans=y.len;
                q.pop();
                se.erase(x);
                a[y.num]=ora[y.num];
                while(que[y.num].front()<y.len)
                    que[y.num].pop();
                que[y.num].pop();
                if(que[y.num].empty()) sum+=a[y.num],a[y.num]=0;
                else if(!se.count(node{y.num,que[y.num].front()}))
                      q.push(node{y.num,que[y.num].front()}),se.insert(node{y.num,que[y.num].front()});
                f.pop();
            }
            else
            {
                continue;
            }
        }
        else
        {
                if(ans+sum < f.front().len)
                {
                    ans+=sum;
                    sum=0;
                    break;
                }
                else
                {
                    sum-=f.front().len-ans;
                    ans=f.front().len;
                    a[f.front().num]=ora[f.front().num];
                    while(que[f.front().num].front()<f.front().len)
                        que[f.front().num].pop();
                    que[f.front().num].pop();
                    if(que[f.front().num].empty()) sum+=a[f.front().num],a[f.front().num]=0;
                    else if(!se.count(node{f.front().num,que[f.front().num].front()}))
                            q.push(node{f.front().num,que[f.front().num].front()}),se.insert(node{f.front().num,que[f.front().num].front()});

                    f.pop();
                }
        }
    }

    ans+=sum;

    cout<<ans<<'\n';
    return;
}

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