#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<iomanip>
#include<queue>
#include<math.h>
#include<map>
#include<bitset>
#include<numeric>
#include <cstring>
#include<array>
#include <string>  
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define int long long
//#define endl "\n"
#define mod 1000000007ll
#define IOS  ios::sync_with_stdio(false),cin.tie(nullptr)
#define syy return
const double pi = acos(-1.0);
using ll = long long;
using pii = pair<int, int>;
using vint = vector<int>;
using vll = vector<ll>;
using vvint = vector<vint>;
using vpo = vector<pii>;
using tup = tuple<int, int, int>;
using vbl = vector<bool>;
constexpr int N = 100000, M = 2000006;//开足够的空间 注意无向图的双向边边数*2
constexpr ll inf = 1e12;
long double eps = 1e-7;

struct node {
    int dis; int id;
    bool operator <(const node& x)const {
        return x.dis < dis;//小根
    }
};

void solve()
{
    int n, m; cin >> n >> m;
    vint a(n + 1);
    for (int i = 1; i <= n; i++)cin >> a[i];
    vpo charge(m + 1);
    vint lastc(m + 1);//该充电站上一个同类充电站
    vint last(n + 1);//每一个电池对应的上一个充电站下标
    priority_queue<node> q;
    for (int i = 1; i <= m; i++) {
        auto& [x, t] = charge[i]; cin >> x >> t;
        if (last[t]==0) {
            q.push({ x,t });
        }
        lastc[i] = last[t];
        last[t] = i; 
    }
    vint next(m + 1);
    for (int i = 1; i <= m; i++) {
        next[lastc[i]] = i;
    }
    for (int i = 1; i <= n; i++)
        if (last[i] == 0)q.push({ inf,i });

    int ans = 0;
    int now = 1;
    charge.emplace_back(inf, 0);
    while (!q.empty()) {
        auto [x, t] = q.top(); q.pop();
        ans += a[t];
        auto& [l,tt] = charge[now];
        if (ans >= l) {
            if (next[now] == 0) {
                q.push({ inf, tt});
            }
            else {
                auto& [r, _] = charge[next[now]];
                q.push({ r-l,tt });
            }
            if (t == tt)ans = l;
            now++;
        }
    }
    cout << ans << endl;

}
signed main()
{
	//IOS;
    int t; cin >> t;
    while (t--)solve();

	return 0;
}