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


void solve() {
    int n, m;cin >> n >> m;
    vector<int>a(n + 1);
    for (int i = 1;i <= n;i++) {
        cin >> a[i];
    }
    auto b = a;
    priority_queue<PII, vector<PII>, greater<PII>>q;
    vector<int>x(m + 1), t(m + 1), vis(n + 1);
    vector<int>p(n + 1, m + 1);

    for (int i = 1;i <= m;i++) {
        cin >> x[i] >> t[i];
        q.emplace(i, t[i]);
        vis[t[i]] = 1;
        p[t[i]] = i;
    }

    for (int i = 1;i <= n;i++) {
        if (!vis[i])q.emplace(m + 1, i);
    }

    fill(vis.begin(), vis.end(), 0);
    queue<int>que[n + 3];
    for (int i = 1;i <= m;i++) {
        que[t[i]].push(i);
    }
    for (int i = 1;i <= n;i++) {
        if (!vis[i]) {
            que[i].push(m + 1);
        }
        vis[i] = 1;
    }

    auto look = [&]() {
        auto tmp = q;
        while (tmp.size()) {
            auto [xx, y] = tmp.top();
            tmp.pop();
            cerr << xx << " " << y << "\n";
        }
        cerr << "\n";
        for (int i = 1;i <= n;i++) {
            cerr << format("b[{}]={}\n", i, b[i]);
        }
        cerr << "\n";
    };

    LL ans = 0;
    for (int i = 1;i <= m;i++) {
        int tp = -1, pid = 0;
        while (not q.empty() and ans < x[i]) {
            auto [tt, id] = q.top();q.pop();
            if (ans + b[id] < x[i]) {
                ans += b[id];
                b[id] = 0;
            }
            else {
                b[id] = ans + b[id] - x[i];
                ans = x[i];
                if (b[id] == 0)break;
                tp = tt, pid = id;
            }
        }
        if (ans < x[i])break;
        if (tp == -1 or (tp != -1 and pid == t[i])) {
            while (!que[t[i]].empty() and p[t[i]] <= i) {
                p[t[i]] = que[t[i]].front();que[t[i]].pop();
            }
        }
        else {
            q.emplace(tp, pid);
            while (!que[t[i]].empty() and p[t[i]] <= i) {
                p[t[i]] = que[t[i]].front();que[t[i]].pop();
            }
        }
        b[t[i]] = a[t[i]];
        q.emplace(p[t[i]], t[i]);
    }
    while (not q.empty()) {
        ans += b[q.top().second];q.pop();
    }
    cout << ans << "\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;
}