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

void solve()
{
    int n, m;
    cin >> n >> m;

    vector<queue<int>> v(n + 1);
    unordered_map<int, int> power;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        q.push({1e18 + 7, i});
    }

    vector<int> mx = a;
    vector<int> p(m + 1);

    for (int i = 1; i <= m; i++)
    {
        int x, t;
        cin >> x >> t;
        q.push({x, t});
        v[t].push(x);
        power[x] = t;
        p[i] = x;
    }

    int pos = 0, idx = 1;
    while (!q.empty())
    {
        while (!q.empty() && q.top().first <= pos)
            q.pop();

        // cout << pos << endl;
        while (!q.empty() && pos + a[q.top().second] < p[idx])
        {
            pos += a[q.top().second];
            a[q.top().second] = 0;
            // v[q.top().second].pop();
            q.pop();
        }
        if (!q.empty() && pos < p[idx])
        {
            a[q.top().second] -= p[idx] - pos;
            pos += p[idx] - pos;
            a[power[pos]] = mx[power[pos]];
            v[power[pos]].pop();
            if (!v[power[pos]].empty())
                q.push({v[power[pos]].front(), power[pos]});
        }

        if (pos < p[idx])
            break;
        idx++;

        if (idx > m)
            break;
    }

    for (int i = 1; i <= n; i++)
    {
        pos += a[i];
    }

    cout << pos << '\n';
}

signed main()
{
    cin.tie(0)->ios::sync_with_stdio(false);

    int t = 1;
    cin >> t;
    while (t--)
        solve();

    return 0;
}