#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=1e6+5;
int T,n,m,a[N],b[N],c[N],o[N],w[N],nw[N];ll s,ans;
void slv()
{
    scanf("%d %d",&n,&m);
	ans=0;
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	for(int i=1;i<=m;++i) scanf("%d %d",&b[i],&c[i]);
	for(int i=1;i<=n;++i) c[m+i]=i;
	fill(nw+1,nw+n+1,0);
	for(int i=n+m;i;--i) nw[c[i]]=i,o[i]=nw[c[i]];
	copy(a+1,a+n+1,w+1);
	s=0;
	for(int i=1;i<=n;++i) s+=w[i];
	priority_queue<int,vector<int>,greater<int>> q;
	for(int i=1;i<=n+m;++i) q.push(i);
	for(int i=1,d;i<=m;++i)
	{
		d=b[i]-b[i-1];
		while(d && !q.empty())
		{
			int t=c[q.top()];
			q.pop();
			int t1=min(d,w[t]);
			w[t]-=t1;
			s-=t1;
			d-=t1;
		}
		if(d) break;
		s+=a[c[i]]-w[c[i]];
		w[c[i]]=a[c[i]];
		ans=max(ans,b[i]+s);
		if(!o[i]) q.push(o[i]);
	}
	printf("%lld\n",ans);
}
int main()
{
    scanf("%d",&T);
    while(T--) slv();
    return 0;
}