#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 1e5;
int T = 1;
int n, m;
ll a[N + 5], b[N + 5];
ll now[N + 5], pos[N + 5];
vector<int> g[N + 5];
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        now[i] = a[i];
        g[i].clear();
    }
    priority_queue<pii, vector<pii>, greater<pii>> q;
    for (int i = 1; i <= m; i++)
    {
        cin >> b[i] >> pos[i];
        g[pos[i]].push_back(i);
        q.push({i, pos[i]});
    }
    ll sum = 0, cur = 0;
    for (int i = 1; i <= n; i++)
    {
        if (g[i].empty())
        {
            sum += a[i];
            now[i] = 0;
        }
    }
    for (int i = 1; i <= m; i++)
    {
        while (!q.empty() && cur < b[i])
        {
            int p = q.top().second;
            int num = q.top().first;
            // cout << p << '\n';
            q.pop();
            if (now[p] < b[i] - cur)
            {
                cur += now[p];
                now[p] = 0;
            }
            else
            {
                now[p] -= b[i] - cur;
                cur += b[i] - cur;
                if (now[p] > 0 && p > i)
                    q.push({num, p});
            }
        }
        if (sum < b[i] - cur)
            break;
        sum -= b[i] - cur;
        cur += b[i] - cur;

        auto it = upper_bound(g[pos[i]].begin(), g[pos[i]].end(), i);

        if (it == g[pos[i]].end())
            sum += a[pos[i]];
        else
        {
            // if (q.empty() || (*it) < q.top().first)
            q.push({(*it), pos[i]});
            now[pos[i]] = a[pos[i]];
            // cout << "YES\n";
        }
        // cout << cur << '\n';
    }
    cout << cur + sum << '\n';
}
int main()
{
    cin >> T;
    while (T--)
        solve();
    return 0;
}