#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAXN=1e5+5;

ll n,m,a[MAXN],x[MAXN],t[MAXN];
ll cur[MAXN],res;
queue<int>q[MAXN];

void input(){
	res=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		res+=a[i];
		cur[i]=a[i];
		while(!q[i].empty())q[i].pop();
	}
	for(int i=1;i<=m;i++){
		cin>>x[i]>>t[i];
		q[t[i]].push(i);
	}
}

void output(){
	cout<<res<<"\n";
}

void solve(){
	input();
	ll tmp=res;
	priority_queue<pair<int,int>>pq;
	for(int i=1;i<=n;i++)
		if(!q[i].empty())
			pq.push({-q[i].front(),i});
		else 
			pq.push({-m-1,i});
	for(int i=1;i<=m;i++){
		ll d=x[i]-x[i-1];
		if(d<=tmp){
			tmp-=d;
			while(d){
				int val=-pq.top().first,tag=pq.top().second;
				pq.pop();
				if(d>=cur[tag])
					d-=cur[tag],cur[tag]=0;
				else{
					cur[tag]-=d,d=0;
					if(val>i)pq.push({-val,tag});
				}
			}
			tmp+=a[t[i]]-cur[t[i]],res+=a[t[i]]-cur[t[i]],cur[t[i]]=a[t[i]];
			q[t[i]].pop();
			if(!q[t[i]].empty())pq.push({-q[t[i]].front(),t[i]});
		}else break;
	}
	output();
}

int main(){
	int t;cin>>t;
	while(t--){
		solve();
	}
}
/*
6
3 2
2 2 2
6 1
7 1
*/