#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100010
int n,m;
int a[N],x[N],t[N],o[N];
int f[N];
vector<int>g[N];
void solve()
{
	cin>>n>>m;
	
	for(int i=1;i<=n;i++) cin>>a[i],o[i]=a[i],g[i].clear();
	
	
	for(int i=1;i<=m;i++) 
	{
		cin>>x[i]>>t[i];
		g[t[i]].push_back(i);//id¿ÉÒÔÔÚµÚ¼¸¸öλÖóäµç 
	}
	
	int s=0;//½ô¼±Çé¿öÏÂÓõ磬²»¿É³äµÄµç 
	for(int i=1;i<=n;i++) if(!g[i].size()) s+=a[i],a[i]=0;
	
	priority_queue<int,vector<int>,greater<int>>q;
	
	for(int i=1;i<=m;i++) q.push(i);
	

	for(int i=1;i<=m;i++)
	{
		int d=a[i]-a[i-1];
		while(d>0&&!q.empty())
		{
			int u=q.top();
			q.pop();
			
			if(u<i) continue;
			
			int id=t[u];
			
			int t=min(a[id],d);
			
			d-=t;
			
			a[id]-=t;
			
			if(a[id]>0) q.push(u);
		}
		
		if(d>0)
		{
			int t=min(d,s);
			s-=t;
			d-=t;
			if(d>0)
			{
				cout<<a[i]-d<<"\n";
				return ;
			}
		}
		
		a[t[i]]=o[t[i]];
		
		auto j=upper_bound(g[t[i]].begin(),g[t[i]].end(),i);
		if(j!=g[t[i]].end()) q.push(*j);
	}
	
	int ans=s+a[m];
	for(int i=1;i<=n;i++) ans+=a[i];
	cout<<ans<<"\n";
}


signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	int T=1;
	cin>>T;
	while(T--) solve();
}