#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353,inf=1e18;
typedef pair<int,int> pi;
void solve()
{
    
    int n,m;
    cin>>n>>m;
    vector<int>a(100005),b(100005),x(100005),y(100005);
    for(int i=1;i<=n;i++)cin>>a[i],b[i]=a[i];
    priority_queue<pi,vector<pi>,greater<pi>>q;
    vector<int>s[n+5];
    for(int i=1;i<=m;i++)
    {
        cin>>x[i]>>y[i];
        s[y[i]].pb(i);
    }
    for(int i=1;i<=n;i++)if(s[i].size())sort(s[i].begin(),s[i].end(),greater());
    for(int i=1;i<=n;i++)
    {
        if(s[i].empty())q.push({mod1,i});
        else
        {
            q.push({s[i].back(),i});
            s[i].pop_back();
        }
    }
    int ans=0;
    int l=1;
    while(q.size())
    {
        pi t=q.top();
        q.pop();
        if(l>m)
        {
            ans+=a[t.second];
            a[t.second]=0;
        }
        else if(ans+a[t.second]>=x[l])
        {
            int w=x[l]-ans;
            ans=x[l];
            a[t.second]-=w;
            a[y[l]]=b[y[l]];
            if(y[l]!=t.second&&a[t.second]!=0)
            {
                if(!s[t.second].empty())
                {
                    q.push({s[t.second].back(),t.second});
                    s[t.second].pop_back();
                }
                else q.push({mod1,t.second});
            }
            if(!s[y[l]].empty())
            {
                q.push({s[y[l]].back(),y[l]});
                s[y[l]].pop_back();
            }
            else q.push({mod1,y[l]});
            l++;
        }
        else
        {
            ans+=a[t.second];
            a[t.second]=0;
        }
    }
    cout<<ans<<'\n';
}
signed main()
{
    io;
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}