#include<bits/stdc++.h>
#define int long long
#define ffor(i,a,b) for(int i=(a);i<=(b);i++)
#define roff(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int MAXN=1e5+10;
int T,n,m,x[MAXN],t[MAXN],ori[MAXN],a[MAXN],nxt[MAXN],occ[MAXN];
struct Node {int pos,id;};
bool operator <(Node A,Node B) {
	return A.pos>B.pos;	
}
signed main() {
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--) {
		cin>>n>>m;
		ffor(i,1,n) cin>>a[i],ori[i]=a[i];
		ffor(i,1,m) cin>>x[i]>>t[i];
		ffor(i,1,n) occ[i]=m+1;
		roff(i,m,1) nxt[i]=occ[t[i]],occ[t[i]]=i;	
		priority_queue<Node> q;
		ffor(i,1,n) q.push({occ[i],i});
		int pos=0,flg=0;
		ffor(i,1,n) {
			while(pos<x[i]&&!q.empty()) {
				if(q.top().pos<i) {q.pop();continue ;}
				int id=q.top().id;
				if(a[id]) {
					if(pos+a[id]<=x[i]) pos+=a[id],a[id]=0,q.pop();
					else a[id]-=x[i]-pos,pos=x[i];
				}
				else q.pop();
			}
			if(pos==x[i]) a[t[i]]=ori[t[i]],q.push({nxt[i],t[i]});
			else {flg=1;break ;}
		}
		ffor(i,1,n) pos+=a[i];
		cout<<pos<<'\n';
	}
	return 0;
}