// 16:30
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>

using namespace std;
using ll = long long;
using PII = pair<int, int>;
#define int long long
// vector<pair<int, int>>

void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> p(n);       // i 个电池的电量
    vector<PII> sta(m);     // first 距离 second ai
    map<int, set<int>> ls;  // 第 i 个站，可以冲哪个车车的电
    for (int i = 0; i < n; i++) {
        cin >> p[i];
    }
    for (int i = 0; i < m; i++) {
        cin >> sta[i].first >> sta[i].second;
        ls[sta[i].first].insert(sta[i].second);
    }
    sort(sta.begin(), sta.end());

    // int now = accumulate(p.begin(), p.end(), 0ll);  // 当前油量

    vector<pair<int, set<int>>> omg(ls.begin(), ls.end());
    sort(omg.begin(), omg.end(), [&](auto x, auto y) { return x.first < y.first; });
    int now = accumulate(p.begin(), p.end(), 0ll);  // 当前油量
    int maxv = now;
    // cout << 'n' << now << endl;

    int loc = 0;  // 当前距离
    for (auto v : omg) {
        if (now + loc >= v.first) {
            now -= v.first;
            loc = v.first;
            for (auto t : v.second) {
                now += p[t - 1];
            }
            now = min(maxv, now);
        }
        // cout << v.first << ' ' << loc << ' ' << now << endl;
    }
    // cout << now << ' ' << loc << endl;
    cout << loc + now << endl;
}

signed main() {
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
}