#include <bits/stdc++.h>
#define N 100005
typedef long long ll;
using namespace std;
ll rec[N],sy[N];
deque<ll> idex[N];
const ll inf = 2e18;
void solve()
{
	ll n, m;
	cin >> n >> m;
	ll ans = 0;
	for (int i = 1; i <= n; i++) {
		cin >> rec[i];
		sy[i] = rec[i];
	}
	priority_queue<pair<ll,ll>,vector<pair<ll, ll>>,greater<pair<ll, ll>> > q;
	vector<int> vis(n + 5);
	for (int i = 1; i <= m; i++)
	{
		int x, t;
		cin >> x >> t;
		if (!vis[t])
		{
			vis[t] = 1;
			q.push({ x,t });
			continue;
		}
		idex[t].push_back(x);
	}
	for (int i = 1; i <= n; i++){
		if (!vis[i])
			q.push({ inf,i });
	}
	while (!q.empty())
	{
		pair<ll, ll> tmp = q.top();
		ll x = tmp.first, id = tmp.second;
		q.pop();
		if (sy[id] >= x - ans){
			ans = x;
			sy[id] = rec[id];
		}
		else
		{
			ll le = x - ans - sy[id];
			ans += sy[id];
			while (!q.empty() && le > 0)
			{
				pair<ll, ll> ttmp = q.top();
				ll xx = ttmp.first, iid = ttmp.second;
				if (sy[iid] >= le) {
					sy[iid] -= le;
					ans += le;
					le = 0;
				}
				else {
					le -= sy[iid];
					ans += sy[iid];
					sy[iid] = 0;
					q.pop();
				}
			}
			if (le > 0)
				break;
		}
		if(idex[id].empty()) q.push({ inf,id });
		else {
			q.push({ idex[id].front(),id });
			idex[id].pop_front();
		}
	}
	cout << ans << "\n";
}

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