#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef unsigned long long ULL;
#define int ll
const int N = 2e5 + 5;

int a[N];

void solve()
{
    int n,m;
    cin>>n>>m;
    int sum=0,maxn=0;
    for(int i=1;i<=n;i++) cin>>a[i],maxn+=a[i];
    priority_queue<PII,vector<PII>,greater<PII>> q;
    for(int i=1;i<=m;i++) {
        int x,y;
        cin>>x>>y;
        q.push({x,y});
    }
    int ans=0;
    sum=maxn;
    while(!q.empty()){
        PII f=q.top();
        q.pop();
        int dis=f.first-ans;
        if(dis<=sum){
            sum-=dis;
            if(a[f.second]<maxn-sum){
                sum+=a[f.second];
            }
            else sum=maxn;
            ans=f.first;
        }
        else {
            cout<<ans+sum<<endl;
            return;
        }
    }
    cout<<ans+sum<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int _ = 1;
    cin >> _;
    while (_--)
    {
        solve();
    }
}