#include<iostream>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<vector>
#include<map>
#include<queue>
#include<set> 
#include<stack>
#include<bitset>
#include<unordered_map>
#include<iomanip>
#include<cassert>
#include<array>
#define fi first
#define se second
#define endl '\n'
#define pb push_back
#define ep emplace_back 
#define debug(x) cout<<x<<'\n'
#define RES cout<<res<<'\n'
#define ANS cout<<ans<<'\n'
#define YES	cout<<"YES"<<'\n'
#define NO cout<<"NO"<<'\n'
#define Yes	cout<<"Yes"<<'\n'
#define No cout<<"No"<<'\n'
#define me(a,x) memset(a,x,sizeof(a))
#define L(i,j,k) for(int i=(j);i<=(k);++i)
#define R(i,j,k) for(int i=(j);i>=(k);--i)
#define r23 cout<<233<<endl;return;
#define int long long 
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<PII,int> PIII;
typedef unsigned long long ull;
const int N=1e5+5,P=131,mod=998244353;
int a[N],b[N];
int x[N],t[N];
int nx[N],mp[N];
void solve(){
	int n,m;cin>>n>>m;
	L(i,1,n)cin>>a[i],b[i]=a[i];
	L(i,1,m)cin>>x[i]>>t[i];//位置 型号
	me(mp,m+1); 
	R(i,m,1){
		nx[i]=mp[t[i]];
		mp[t[i]]=i;
	}
	priority_queue<PII,vector<PII>,greater<PII>> q;
	L(i,1,n)q.push({mp[i],i});//充电位置 序号id 
	int res=0,k=1;
	while(!q.empty()){
		auto tt=q.top();
		q.pop();
		int pos=tt.fi,id=tt.se;
		int dis=x[k]-res;//距离下一个充电站距离 
		if(k<=m&&a[id]>=dis){
			a[id]-=dis;
			res+=dis;
			a[t[k]]=b[t[k]];
			q.push({nx[k],t[k]});
			if(id!=t[k])q.push({pos,id});
			k++;
		}else{
			res+=a[id];
			a[id]=0;
		} 
	}
	RES;
}
// 4 3 2 2 4 1 3
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T=1;
	cin>>T;
	while(T--){
		solve();
	}
}