#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
const int inf = 1e9 + 10;
const int maxn = 1e5 + 10;
int a[maxn];
vector<queue<int>> vec;
int x[maxn];
int t[maxn];
void solve()
{
    cin >> n >> m;
    vec.resize(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= m; i++)
    {
        cin >> x[i] >> t[i];
        vec[t[i]].push(x[i]);
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    for (int i = 1; i <= n; i++)
    {
        if (vec[i].size())
        {
            q.push({vec[i].front(), a[i]});
            vec[i].pop();
        }
        else
        {
            q.push({inf, a[i]});
            // vis[i] = 1;
        }
    }
    int j = 1;
    int ans = 0;
    while (q.size() && j <= m)
    {
        auto ft = q.top();
        q.pop();
        if (ans + ft.second >= x[j])
        {
            ft.second -= x[j] - ans;
            ans = x[j];
            if (ft.second && ft.first != x[j])
            {
                q.push(ft);
            }
            if (vec[t[j]].size())
            {
                q.push({vec[t[j]].front(), a[t[j]]});
                vec[t[j]].pop();
            }
            else
            {
                q.push({inf, a[t[j]]});
                // vis[t[j]] = 1;
            }
            j++;
        }
        else
        {
            ans += ft.second;
        }
    }

    while (q.size())
    {
        auto ft = q.top();
        q.pop();
        ans += ft.second;
    }
    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}