#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define per(i,a,n) for(int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) {return mrand()%x;}
const ll mod=998244353;
// head

const int N=1e5+10;
ll n,m;
ll a[N];

void solve() {
	cin>>n>>m;
	ll pa=0;
	rep(i,1,n+1) cin>>a[i],pa+=a[i];
	vector<pll> ls(m+1);
	rep(i,1,m+1) {
		cin>>ls[i].fi>>ls[i].se;
	}
	sort(all(ls),[&](pii a,pii b){
		return a.fi<b.fi;
	});
	vl p(n+1);
	ll res=pa,L=0,rc=0;
	rep(i,1,m+1) {
		ll nl=ls[i].fi,na=ls[i].se;
		if (res<nl) break;
		ll c=min(a[na],nl-rc+p[na]);
		p[na]=c-nl;
		L=nl,res+=c,rc+=c;
	}
	cout<<res<<endl;
}


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