#include<bits/stdc++.h>

using namespace std;
#define ll long long

const int N = 1e5 + 100;

ll T, n, m, a[N], res[N], x[N], t[N];
deque<ll> lev[N];

struct node {
    ll level, number;

    node(ll a, ll b) {
        level = a, number = b;
    }
};

struct cmp {
    bool operator()(node a1, node a2) {
        return a1.level > a2.level;
    }
};

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) res[i] = a[i], lev[i].clear();

    for (int i = 1; i <= m; i++) cin >> x[i] >> t[i];
    for (int i = 1; i <= m; i++) lev[t[i]].push_back(i);
    for (int i = 1; i <= n; i++) lev[i].push_back(m + 1);

    priority_queue<node, vector<node>, cmp> q;
    for (int i = 1; i <= n; i++) q.emplace(lev[i].front(), i);

    ll sum = 0;
    for (int i = 1; i <= m; i++) {
        while (sum < x[i] && !q.empty()) {
            ll p = q.top().number;
            q.pop();
            ll next = min(res[p], x[i] - sum);
            res[p] -= next;
            sum += next;
            if (res[p] > 0) q.emplace(lev[p].front(), p);
            else lev[p].pop_front();
        }
        res[t[i]] = a[t[i]];
        if (q.top().level == i) q.pop();
        if (lev[t[i]].front() == i) lev[t[i]].pop_front();
        q.emplace(lev[t[i]].front(), t[i]);
    }
//    printf("res:");
//    for (int i = 1; i <= n; i++) printf("%lld ", res[i]);
//    printf("\n");
    for (int i = 1; i <= n; i++) sum += res[i];
    cout << sum << "\n";

}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}