#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 100100;

ll n, m, a[maxn], c[maxn];
pii b[maxn];
vector<ll> vc[maxn];

void solve() {
	scanf("%lld%lld", &n, &m);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
		c[i] = a[i];
		vector<ll>().swap(vc[i]);
	}
	for (int i = 1; i <= m; ++i) {
		scanf("%lld%lld", &b[i].fst, &b[i].scd);
		vc[b[i].scd].pb(b[i].fst);
	}
	for (int i = 1; i <= n; ++i) {
		vc[i].pb(1e18);
		reverse(vc[i].begin(), vc[i].end());
	}
	set<pii> S;
	ll ans = 0, j = 1;
	for (int i = 1; i <= n; ++i) {
		S.emplace(vc[i].back(), i);
	}
	while (S.size()) {
		pii p = *S.begin();
		S.erase(S.begin());
		ans += a[p.scd];
		a[p.scd] = 0;
		while (j <= m && b[j].fst <= ans) {
			a[b[j].scd] = c[b[j].scd];
			vc[b[j].scd].pop_back();
			S.emplace(vc[b[j].scd].back(), b[j].scd);
			++j;
		}
	}
	printf("%lld\n", ans);
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}