#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<int> cnt(n + 7);
    vector<PII> pd;
    vector<vector<int>> pos(n + 7);
    vector<int> ind(n + 7);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    auto b = a;
    set<PII> st;
    for (int i = 1; i <= m; i++) {
        int x, t;
        cin >> x >> t;
        st.insert({x, t});
        pd.push_back({x, t});
        pos[t].push_back(x);
        cnt[t] ++;
    }
    int now = 0, idx = 0, sum = 0;
    for (int i = 1; i <= n ; i ++) {
        if (!cnt[i])
            sum += a[i];
    }
    while (idx < m) {
        vector<PII> era;
        while (1) {
            for (auto [x, y] : st) {
                if (now + a[y] <= pd[idx].first)
                    now += a[y], a[y] = 0, era.push_back({x, y});
                else {
                    a[y] -= pd[idx].first - now;
                    now = pd[idx].first;
                    break;
                }
            } 
            if (now >= pd[idx].first)
                break;
            if (now + sum <= pd[idx].first) {
                now += sum;
                cout << now << endl;
                return;
            }
            else {
                sum -= pd[idx].first - now;
                now = pd[idx].first;
                break;
            }
        }
        
        a[pd[idx].second] = b[pd[idx].second];
        cnt[pd[idx].second] --;
        if (!cnt[pd[idx].second])
            sum += a[pd[idx].second];

        for (auto j : era)
            st.erase(j);   
        while (st.size() && pd[idx].first >= st.begin()->first)
            st.erase(st.begin());
        while (ind[pd[idx].second] < pos[pd[idx].second].size() && pos[pd[idx].second][ind[pd[idx].second]] <= pd[idx].first) 
            ind[pd[idx].second] ++;
        if (ind[pd[idx].second] < pos[pd[idx].second].size())
            st.insert({pos[pd[idx].second][ind[pd[idx].second]], 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;
}