#include <bits/stdc++.h>
using ll = long long;

void solve() {
	int n, m; std::cin >> n >> m;
	std::vector<ll> a(n + 1), x(m + 1, 0), t(m + 1, 0), able(m + 1, 0);
	for(int i = 1; i <= n; i++) std::cin >> a[i];
	for(int i = 1; i <= m; i++) std::cin >> x[i] >> t[i];
	ll need = 0;
	for(int i = 1; i <= m; i++) {
		ll d = x[i] - x[i - 1];
		if(a[t[i]] <= d) {
			able[i] = a[t[i]];
			need += d - a[t[i]];
		}
		else {
			if(need >= a[t[i]] - d) {
				need -= a[t[i]] - d;
				able[i] = a[t[i]];
			}
			else {
				able[i] = need + d;
				need = 0;
			}
		}
	}
	ll sum = 0;
	for(int i = 1; i <= n; i++) sum += a[i];
	ll ans = 0;
	for(int i = 1; i <= m; i++) {
		if(sum >= x[i] - x[i - 1]) {
			sum -= (x[i] - x[i - 1]);
			ans += (x[i] - x[i - 1]);
			sum += able[i];
		}
		else break;
	}
	ans += sum;
	std::cout << ans << '\n';
}

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