#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
int a[N];
unordered_map<int,int> p;
void solve()
{
    int n,m;
    cin>>n>>m;
    ll sum = 0;
    if(n>100000||n<1){
        cout<<0<<'\n';
        return ;
    }
    for(int i=1;i<=n;i++){
        cin>>a[i];
        sum += a[i];
        p[i] = 0;
    }
    ll len = 0;
    ll  x;
    int y;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        if(y>100000||y<1){
            cout<<0<<'\n';
            return ;
        }
        if(x-len>sum){
            cout<<len+sum<<'\n';
            return ;
        }
        ll acm = a[y] - x + p[y];
        if(acm<0)acm = 0;
        ll res = x - len - acm;
        if(res>0){
            sum-=res;
            sum+=a[y];
        }
        //sum+=a[y];
        p[y] = x;
        len = x;
    }
    cout<<x+sum<<"\n";
    return ;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
        solve();

    return 0;
}