#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define se second
#define int long long
inline int read(){
	int n=0; int f=1;
	char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') f=-1; c=getchar();}
	while(c<='9'&&c>='0') n=(n<<1)+(n<<3)+c-'0',c=getchar();
	return n*f;
}
using namespace std;
int n,m;
const int N=2e6+10;
int a[N],t[N],p[N],l[N];
int sum=0,ans=0;
priority_queue<pii> pq;
int tong[N],nxt[N];
signed main(){
	int T=read();
	
	while(T--){
		while(!pq.empty()) pq.pop();
		for(int i=1;i<=n;i++) tong[i]=0;
		for(int i=1;i<=m;i++) nxt[i]=0;
		n=read(),m=read();
		sum=0, ans=0;
		for(int i=1;i<=n;i++) l[i]=read(),sum+=l[i],a[i]=l[i];
		for(int i=1;i<=m;i++) p[i]=read(),t[i]=read();
		for(int i=m;i>=1;i--){
			nxt[i]=(tong[t[i]]?m+1:tong[t[i]]),tong[t[i]]=i;
			pq.push({-i,t[i]});
		}
		for(int i=1;i<=n;i++) pq.push({-m-1,i});
		p[m+1]=1e17;
		for(int i=1;i<=m+1;i++){
			int dis=p[i]-p[i-1];
			if(dis>sum){
				ans+=sum;
				sum=0;
				break;
			}
			int tot=0;
			while(dis){
				while(-pq.top().fi<i) pq.pop(),assert(++tot<=10000000);
				int now=pq.top().se; 
				if(dis>l[now]) dis-=l[now], ans+=l[now], sum-=l[now], l[now]=0, pq.pop();
				else l[now]-=dis, ans+=dis, sum-=dis, dis=0;
			}
			sum+=a[t[i]]-l[t[i]], l[t[i]]=a[t[i]];
			pq.push({-nxt[i],t[i]});
		}
		printf("%lld\n",ans);
	}

	return 0;
}