#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define db double
const int mod=1e9+7;
const int N=2e5+5;

void abt() {
    int n,m;
    cin>>n>>m;
    vector<int>a(n+1);
    vector<int>maxa(n+1);
    vector<vector<int>> b(n+1);
    vector<pair<int,int>> pos(m+1);
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>> > q;
    for(int i=1;i<=n;i++) cin>>a[i],maxa[i]=a[i];
    for(int i=1;i<=m;i++){
        int t1,t2;
        cin>>t1>>t2;
        pos[i]={t1,t2};
        b[t2].push_back(t1);
    }
    for(int i=1;i<=n;i++){
        b[i].push_back(1e18);
    }
    for(int i=1;i<=n;i++){
        sort(b[i].begin(),b[i].end(),greater<int>());
        q.push({b[i].back(),i});
        b[i].pop_back();
    }
    int nowpos=0;
    int f=0;
    for(int i=1;i<=m;i++){
        while(nowpos<pos[i].first&&!q.empty()){
            auto now=q.top();
            int type=now.second;
            int minn=min(a[type],pos[i].first-nowpos);
            nowpos+=minn;
            a[type]-=minn;
            if(!a[type]) q.pop();
            // cout<<nowpos<<endl;
            // for(int j=1;j<=n;j++) {
            //     cout<<a[j]<<" \n"[j==n];
            // }
        }
        if(nowpos>=pos[i].first){
            if(q.top().first==pos[i].first) q.pop();
            a[pos[i].second]=maxa[pos[i].second];
            q.push({b[pos[i].second].back(),pos[i].second});
            b[pos[i].second].pop_back();
            // cout<<nowpos<<endl;
            // for(int j=1;j<=n;j++) {
            //     cout<<a[j]<<" \n"[j==n];
            // }
        }else{
            break;
        }
    }
    for(int i=1;i<=n;i++){
        nowpos+=a[i];
    }
    cout<<nowpos<<'\n';
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    cout<<fixed<<setprecision(9);
    int T=1;
    cin>>T;
    while(T--) abt();
    return 0;
}