#include <bits/stdc++.h>

using namespace std;

bool cmp(pair<int, int> a, pair<int, int> b) {
    return a.first < b.first;
}

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    vector<int> maxnum(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        maxnum[i] = a[i];
    }
    // 存距离
    // 存油（按距离存）
    vector<pair<int, int>> st;
    vector<int> use(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        st.push_back({x, y});
        use[y] = 1;
    }
    queue<int> backup;
    for (int i = 1; i <= n; i++) {
        if (use[i] == 0) {
            backup.push(i);
        }
    }
    sort(st.begin(), st.end(), cmp);
    queue<int> oil;
    for (int i = 0; i < m; i++) {
        oil.push(st[i].second);
    }
    long long ans = 0;
    for (int i = 0; i < m; i++) {
        while (ans < st[i].first && !oil.empty()) {
            int oilpos = oil.front();
            if (ans + a[oilpos] < st[i].first) {
                ans += 1LL * a[oilpos];
                a[oilpos] = 0;
                oil.pop();
            } else if (ans + a[oilpos] >= st[i].first) {
                a[oilpos] -= 1LL * st[i].first - ans;
                a[st[i].second] = maxnum[st[i].second];
                ans = 1LL * st[i].first;
                oil.pop();
                oil.push(oilpos);
                oil.push(st[i].second);
            }
        }
        while (ans < st[i].first && !backup.empty()) {
            int oilpos = backup.front();
            if (ans + a[oilpos] < st[i].first) {
                ans += 1LL * a[oilpos];
                a[oilpos] = 0;
                backup.pop();
            } else if (ans + a[oilpos] >= st[i].first) {
                a[oilpos] -= 1LL * st[i].first - ans;
                a[st[i].second] = maxnum[st[i].second];
                oil.push(st[i].second);
                ans = st[i].first;
            }
        }
    }
    while (!oil.empty()) {
        ans += 1LL * a[oil.front()];
        a[oil.front()] = 0;
        oil.pop();
    }
    while (!backup.empty()) {
        ans += 1LL * a[backup.front()];
        a[backup.front()] = 0;
        backup.pop();
    }
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}