#include <bits/stdc++.h>
#define endl "\n"
#define int long long
using namespace std;

typedef pair<int, int> PII;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 7);
    vector<PII> pd;
    vector<int> cnt(n + 7);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    auto b = a;
    for (int i = 1; i <= m; i++) {
        int x, t;
        cin >> x >> t;
        pd.push_back({x, t});
        cnt[t] ++;
    }
    int now = 0, idx = 0, sum = 0;
    for (int i = 1; i <= n ; i ++) {
        if (!cnt[i])
            sum += a[i];
    }
    int idxr = 0;
    while (idx < m) {
        while (1) {
            if (idxr < m) {
                if (now + a[pd[idxr].second] < pd[idx].first)
                    now += a[pd[idxr].second], a[pd[idxr].second] = 0;
                else {
                    a[pd[idxr].second] -= pd[idx].first - now;
                    now = pd[idx].first;
                    break;
                }
            }
            else {
                if (now + sum < pd[idx].first) {
                    now += sum;
                    cout << now << endl;
                    return;
                }
                else {
                    sum -= pd[idx].first - now;
                    now = pd[idx].first;
                    break;
                }
            }
            idxr ++;
        }
        a[pd[idx].second] = b[pd[idx].second];
        cnt[pd[idx].second] --;
        if (!cnt[pd[idx].second])
            sum += a[pd[idx].second];
        idx ++;
    }
    cout << now + sum << endl;
}

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