#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define sz(C)		 ((int)size(C))
#define all(C)		 begin(C), end(C)
#define rep(i, a, b) for (int i = (a); i < (b); i++)

int	 t = 1;
void pre();
void go();

int main()
{
	pre();

	while (t--)
		go();
}

void pre()
{
	cin.tie(0)->sync_with_stdio(0);
	cin >> t;
}

vector<int>														  A, C;
vector<pair<int, int>>											  X;
vector<vector<int>>												  T;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> Q;

void go()
{
	int n, m;
	cin >> n >> m;
	A.resize(n);
	T.assign(n, {});
	X.resize(m);
	for (int &a : A)
		cin >> a;
	C = A;
	for (auto &[x, i] : X)
	{
		cin >> x >> i;
		i--;
		T[i].push_back(x);
	}
	for (int i = 0; i < n; i++)
	{
		T[i].push_back(INT_MAX);
		reverse(all(T[i]));
		Q.emplace(T[i].back(), i);
	}

	int pos = 0;
	for (auto [x, i] : X)
	{
		while (!Q.empty() && pos < x)
		{
			auto [y, j] = Q.top();
			int amt		= min(C[j], x - pos);
			pos += amt;
			C[j] -= amt;
			if (C[j] == 0)
				Q.pop();
		}
		if (pos < x)
			break;
		if (C[i] > 0)
			Q.pop();
		C[i] = A[i];
		T[i].pop_back();
		Q.emplace(T[i].back(), i);
	}

	cout << pos + accumulate(all(C), 0ll) << '\n';
}