#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int T;
	cin >> T;
	while(T -- ) {
		int n, m;
		cin >> n >> m;
		vector<int> a(n + 1);
		for(int i = 1; i <= n; i ++ ) cin >> a[i];
		vector<pair<int, int>> chr(m + 1);
		for(int i = 1; i <= m; i ++ ) {
			cin >> chr[i].first >> chr[i].second;
		}
		chr[0] = {0, -1};

		ll all = 0;
		for(int i = 1; i <= n; i ++ ) all += a[i];

		ll ans = 0, cost = 0;
		for(int i = 1; i <= m; i ++ ) {
			auto [x, t] = chr[i];
			int dis = x - chr[i - 1].first;

			if(all >= dis) {
				if(a[t] >= dis + cost) {
					all = all + cost;
					cost = 0;
				} else {
					all = all - dis + a[t];
					cost = cost + dis - a[t];
				}
			} else {
				break;
			}
			ans = x;
		}
		cout << ans + all << '\n';
	}
	return 0;
}