#include <bits/stdc++.h>
#define MAX 0x3f3f3f3f
#define endl "\n"
using namespace std;
using ll = long long;
struct node{
	ll x,t;
};
void solve(){
	int n,m;
	cin>>n>>m;
	vector <ll> a(n+5);
	vector <node> b(n+5);
	ll ext=0;
	ll ans=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		ans+=a[i];
	}
	for(int i=1;i<=m;i++){
		cin>>b[i].x>>b[i].t;
	}
	ll sum=0;
	for(int i=1;i<=m;i++){
		sum+=b[i].x-b[i-1].x;
		ans+=min(sum,a[b[i].t]);
		sum-=min(sum,a[b[i].t]);
	}
	cout<<ans<<endl;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//solve();
	ll t;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}