#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 200010;
int a[N], maxa[N];
struct node {
	int x, u;
	bool operator>(const node& b)const {
		return x > b.x;
	}
	bool operator<(const node& b)const {
		return x < b.x;
	}
}b[N];

void solve() {
	int n, m;
	priority_queue<node, vector<node>, greater<node> > q;
	cin >> n >> m;
	map<int, int> mp, last;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) maxa[i] = a[i];
	for (int i = 1; i <= m; i++) cin >> b[i].x >> b[i].u, q.push(node{ b[i].x,b[i].u });
	b[m + 1] = node{ (int)1e18,0 };
	sort(b + 1, b + 1 + m + 1);
	for (int i = 1; i <= n; i++) q.push(node{ (int)1e18,i });
	for (int i = 1; i <= n; i++) mp[i] = 1e18;
	for (int i = m; i >= 1; i--) {
		last[b[i].x] = mp[b[i].u];
		mp[b[i].u] = b[i].x;
	}
	last[1e18] = 1e18;
	// for (int i = 1; i <= n; i++) {
	// 	cout << b[i].x << " " << b[i].u << " " << last[b[i].x] << "\n";
	// }
	int l = 0;
	for (int i = 1; i <= m + 1; i++) {
		// cout << "i: " << i << "\n";
		while (!q.empty()) {
			node t = q.top();
			// cout << "\n" << "l-:" << l << " ";
			// cout << t.x << "," << t.u << ":" << a[t.u] << "->";
			if (a[t.u] > b[i].x - l) {
				a[t.u] -= b[i].x - l;
				// cout << a[t.u] << "\n";
				l = b[i].x;
				if (t.x == b[i].x) {
					q.pop();
					q.push(node{ last[t.x],t.u });
				}
				break;
			}
			else {
				l += a[t.u];
				a[t.u] = 0;
				// cout << a[t.u] << "\n";
				q.pop();
			}
		}
		if (l < b[i].x) break;
		node t = node{ last[b[i].x],b[i].u };
		a[t.u] = maxa[t.u];
		q.push(t);
		// cout << "in " << t.x << " " << t.u << " " << a[t.u] << "\n";
	}
	cout << l << "\n";
}

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