#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define int long long
using PII = pair<int, int>;

template<class T, class Cmp = less<T>>
struct Heap {
    priority_queue<T, vector<T>, Cmp>qPush, qErase;
    void insert(T x) {
        qPush.emplace(x);
    }
    void erase(T x) {
        qErase.emplace(x);
    }
    T top() {
        while (!qErase.empty() && qPush.top() == qErase.top())
            qPush.pop(), qErase.pop();
        return  qPush.top();
    }
    void pop() {
        while (!qErase.empty() && qPush.top() == qErase.top())
            qPush.pop(), qErase.pop();
        qPush.pop();
    }
    int size() {
        return (int)qPush.size() - (int)qErase.size();
    }
};

void solve() {
    int n, m;cin >> n >> m;
    vector<int>a(n + 1);
    Heap<PII>q;
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
        q.insert({ a[i],i });
    }
    auto b = a;
    vector<int>x(m + 1), t(m + 1);
    for (int i = 1;i <= m;i++) {
        cin >> x[i] >> t[i];
    }
    LL sum = 0;
    for (int i = 1;i <= m;i++) {
        if (q.size() == 0)break;
        int now = b[t[i]];
        if (sum + now >= x[i]) {
            sum = x[i];
        }
        else {
            sum += now;
            q.erase({ b[t[i]],t[i] });
            b[t[i]] = 0;
            while (q.size() and sum + q.top().first < x[i]) {
                sum += q.top().first;
                q.pop();
            }
            if (!q.size())break;
            LL res = x[i] - sum;
            sum = x[i];
            auto [t, id] = q.top();q.pop();
            q.insert({ t - res,id });
            b[id] = t - res;
            q.insert({ a[i],i });
        }

    }
    while (q.size()) {
        sum += q.top().first;
        q.pop();
    }
    cout << sum << "\n";

}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    cin >> T;
    while (T--)
        solve();
    return 0;
}