#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

struct station {
    int x, t;
    bool operator<(const station &p) const {
        return x > p.x;
    }
};

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> cap(n + 1);
    vector<int> pcap(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> cap[i];
        pcap[i] = cap[i];
    }
    vector<pair<int, int> > sta(m);
    for (int i = 0; i < m; i++) {
        int x, t;
        cin >> x >> t;
        sta[i] = {x, t};
    }
    sort(sta.begin(), sta.end());

    vector<vector<int> > t(n + 1);
    vector<int> pt(n + 1, 0);
    for (auto [x, tt] : sta) t[tt].emplace_back(x);

    priority_queue<station> pq;
    i64 capl = 0;
    for (int i = 1; i <= n; i++) {
        if (t[i].size()) {
            pq.push({t[i][0], i});
            pt[i]++;
        } else
            capl += cap[i];
    }

    i64 px = 0;
    for (int i = 0; i < m; i++) {
        auto [x, idx] = sta[i];
        while (pq.size() && pcap[pq.top().t] <= x - px) {
            px += pcap[pq.top().t];
            cerr << px << '\n';
            pcap[pq.top().t] = 0;
            pq.pop();
        }
        //cerr << px << '\n';

        if (pq.size()) {
            pcap[pq.top().t] -= (x - px);
            px = x;
        } else {
            if (capl >= (x - px)) {
                capl -= (x - px);
                px = x;
            } else {
                px += capl;
                cout << px << '\n';
                return;
            }
        }

        pcap[idx] = cap[idx];
        if (pt[idx] < t[idx].size()) {
            pq.push({t[idx][pt[idx]], idx});
            pt[idx]++;
        } else {
            capl += cap[idx];
        }
    }

    cout << px + capl << '\n';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int _;
    cin >> _;
    while (_--) solve();

    return 0;
}