#include <bits/stdc++.h>

#define x first
#define y second
#define int long long

using PII = std::pair<int, int>;

const int N = 1e5+10, INF = 1e9+10;

void solve()
{
	int n, m; std::cin >> n >> m;
	std::vector<int> a(n+1), enr(n+1);
	std::vector<std::vector<int>> chr(n+1);
	std::vector<int> pos(m+1);
	std::vector<int> idx(m+1);
	std::vector<int> b(m+1);

	for(int i = 1; i <= n; i ++ )
	{
		std::cin >> a[i];
		enr[i] = a[i];
	}

	for(int i = 1; i <= m; i ++ )
	{
		std::cin >> pos[i] >> b[i];
		chr[b[i]].emplace_back(pos[i]);
	}

	std::priority_queue<PII, std::vector<PII>, std::greater<PII> > hp;
	for(int i = 1; i <= n; i ++ )
	{
		chr[i].emplace_back(INF);
		hp.emplace(chr[i][0], i);
	}

	int ans = 0;
	for(int i = 1; i <= m; i ++ )
	{
		int d = pos[i]-pos[i-1];
		while(hp.size())
		{
			auto [x, t] = hp.top();
			int cost = std::min(d, enr[t]);
			enr[t] -= cost;
			d -= cost;
			ans += cost;
			if(!enr[t]) hp.pop();
			if(!d) break;
		}

		if(!d)
		{
			int t = b[i];
			if(hp.size() && hp.top().y == t)
				hp.pop();
			enr[t] = a[t];
			hp.emplace(enr[t], t);
		}

		// for(int x: enr)
		// 	std::cout << x << ' ';
		// std::cout << '\n';
	}

	for(int& x: enr)
		ans += x;

	std::cout << ans << '\n';
}

signed main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t; std::cin >> t;
	while(t -- )
	{
		solve();
	}

	return 0;
}