#include<bits/stdc++.h>

using namespace std;

const int N=500010;

int n,m;
int a[N];
pair<int,int> b[N];
int now[N];
int t[N];
vector<int> p[N];
int ls(int u)
{
    return u<<1;
}
int rs(int u)
{
    return u<<1|1;
}
void Pushup(int u)
{
    t[u]=min(t[ls(u)],t[rs(u)]);
}
void Build(int u,int l,int r)
{
    if(l==r)
    {
        t[u]=1000000010;
        return;
    }
    int mid=(l+r)/2;
    Build(ls(u),l,mid);
    Build(rs(u),mid+1,r);
    Pushup(u);
}
void Modify(int u,int l,int r,int p,int k)
{
    if(l==r)
    {
        t[u]=k;return;
    }
    int mid=(l+r)/2;
    if(p<=mid) Modify(ls(u),l,mid,p,k);
    else Modify(rs(u),mid+1,r,p,k);
    Pushup(u);
}

void Solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        p[i].clear();
    for(int i=1;i<=n;i++)
        cin>>a[i];
    for(int i=1;i<=m;i++)
    {
        auto &[pos,col]=b[i];
        cin>>pos>>col;
        p[col].push_back(i);
    }
    Build(1,1,n);
    for(int i=1;i<=n;i++)
        now[i]=a[i];
    for(int i=1;i<=n;i++)
        if(p[i].size())
        {
            reverse(p[i].begin(),p[i].end());
            Modify(1,1,n,i,p[i].back());
            // cerr<<"Col: "<<i<<" "<<p[i].back()<<"\n";
        }
    int cur=0,pid=1;
    while(1)
    {
        // cerr<<cur<<" "<<pid<<"========\n";
        while(pid<=m && cur>=b[pid].first)
        {
            auto [pos,col]=b[pid];
            if(cur==pos)// get b[pid]
            {
                now[col]=a[col];
            }
            pid++;
        }
        //b[pid] is the next station
        if(pid>m) break;
        while(t[1]<=m && b[t[1]].first<=cur)
        {
            // cerr<<t[1]<<"#\n";
            auto [_,col]=b[t[1]];
            if(p[col].size())
            {
                Modify(1,1,n,col,p[col].back());
                p[col].pop_back();
            }
            else
            {
                Modify(1,1,n,col,1000000000);
            }
        }
        int id=t[1];
        // use col of the id station
        if(id>m) break;
        auto [_,col]=b[id];
        // cerr<<"col="<<col<<"\n";
        int go=min(now[col],b[pid].first-cur);
        // cerr<<"go=min:"<<now[col]<<" "<<b[pid].first-cur<<"\n";
        cur+=go;
        now[col]-=go;
        if(now[col]==0) Modify(1,1,n,col,1000000000);
    }
    for(int i=1;i<=n;i++)
        cur+=now[i];
    while(pid<=m)
    {
        auto [pos,col]=b[pid];
        if(cur>=pos) cur+=a[col],pid++;
        else break;
    }
    cout<<cur<<"\n";
}

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