#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,j,k) for(int i=j;i<=k;++i)
#define per(i,j,k) for(int i=j;i>=k;--i)
int const N=1e5+10;
int n,m,a[N],nxt[N],x[N],nw[N],t[N],res[N];
inline void solve(){
	cin>>n>>m;
	int sm=0;
	rep(i,1,n) cin>>a[i],res[i]=a[i],sm+=a[i];
	rep(i,1,m) cin>>x[i]>>t[i];
	map<int,int>mp;
	per(i,m,1)
		if (mp.count(t[i])) nxt[i]=mp[t[i]];
		else nxt[i]=m+1;
	set< pair<int,int> >s;
	rep(i,1,n)
		if (mp.count(i)) nw[i]=m+1,s.insert({m+1,i});
		else nw[i]=mp[i],s.insert({mp[i],i});
	rep(i,1,m){
		if (x[i]>sm) break;
		int delta=x[i]-x[i-1];
		while (1){
			auto it=*s.begin();s.erase(it);
			int id=it.second;
			if (res[id]>delta){res[id]-=delta,s.insert(it);break;}
			else delta-=res[id],res[id]=0;
		}
		if (res[t[i]]) s.erase({nw[t[i]],t[i]});
		sm+=a[t[i]]-res[t[i]],res[t[i]]=a[t[i]];
		nw[t[i]]=nxt[i],s.insert({nw[t[i]],t[i]});
	}
	cout<<sm<<'\n';
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t;cin>>t;
    while (t--) solve();
    return 0;
}
/*
2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1
*/