#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=100005;
const ll INF=15LL<<58;

vi wh[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,M;cin>>N>>M;
        for(int i=0;i<N;i++){
            wh[i].clear();
        }
        vl A(N),B(N);
        for(int i=0;i<N;i++){
            cin>>A[i];
        }
        B=A;
        vl len={0};
        vi tp(M);
        for(int i=0;i<M;i++){
            ll x,t;cin>>x>>t;t--;
            wh[t].pb(i);
            len.pb(x);
            tp[i]=t;
        }
        len.pb(INF);
        for(int i=si(len)-1;i>=1;i--){
            len[i]-=len[i-1];
        }
        len.erase(len.begin());
        for(int i=0;i<N;i++){
            wh[i].pb(M);
            reverse(all(wh[i]));
        }
        
        priority_queue<array<ll,3>> PQ;
        
        for(int i=0;i<N;i++){
            PQ.push({-wh[i].back(),B[i],i});
        }
        
        ll ans=0;
        
        for(int ii=0;ii<si(len);ii++){
            ll rem=len[ii];
            while(rem){
                if(si(PQ)==0) break;
                auto [t,h,i]=PQ.top();PQ.pop();
                t*=-1;
                ll can=min(h,rem);
                ans+=can;
                if(can==h){
                    rem-=can;
                    B[i]=0;
                }else{
                    rem-=can;
                    B[i]-=can;
                    PQ.push({-t,B[i],i});
                }
            }
            
            if(rem) break;
            
            int i=tp[ii];
            
            if(PQ.top()[2]==i){
                PQ.pop();
                B[i]=A[i];
                wh[i].pop_back();
                PQ.push({-wh[i].back(),B[i],i});
            }else{
                B[i]=A[i];
                wh[i].pop_back();
                PQ.push({-wh[i].back(),B[i],i});
            }
        }
        
        cout<<ans<<"\n";
    }
}