#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using db = long double;
class JudTime {
public:
    chrono::time_point<chrono::high_resolution_clock> start, end;
    JudTime() : start(chrono::high_resolution_clock::now()) {}
    ~JudTime() {
        end = chrono::high_resolution_clock::now();
        cerr << fixed << setprecision(6) << chrono::duration<double>(end - start).count()
             << " seconds" << endl;
    }
};
const int N = 1e5 + 5;
ll a[N];
ll last[N];
pll v[N];   // first位置，second充电目标
void solve() {
    int n, m;
    cin >> n >> m;
    ll all = 0;
    for (int i = 1; i <= n; i++) {
        last[i] = 0;
        cin >> a[i];
        all += a[i];
    }
    for (int i = 1; i <= m; i++) cin >> v[i].first >> v[i].second;
    sort(v + 1, v + 1 + m, [](pll x, pll y) {
        if (x.first == y.first) return a[x.second] > a[y.second];
        return x.first < y.first;
    });
    v[0] = {0, 0};
    ll sum = 0;   //欠费数
    for (ll i = 1; i <= m; i++) {
        ll dis = v[i].first - v[i - 1].first;   //路程
        ll get = min(v[i].first - last[v[i].second], a[v[i].second]);
        if (sum + dis - get > all) {
            cout << v[i - 1].first + all - sum << endl;
            return;
        }
        last[v[i].second] = v[i].first;
        sum += dis;   //欠费数
        sum = max(0ll, sum - get);
    }
    cout << v[m].first + all - sum << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    //   JudTime judTime;
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}