#include <bits/stdc++.h>
using namespace std;
bool Memory_begin;

/*

*/

bool Memory_end;

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cerr << (&Memory_end - &Memory_begin) / 1048576.0 << "MB" << '\n';

    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        vector<int> a(n);
        for (int i = 0; i < n; i++)
            cin >> a[i];
        auto c = a;
        vector<pair<int, int>> b(m);
        vector<int> lst(n, -1);
        for (int i = 0; i < m; i++)
        {
            cin >> b[i].first >> b[i].second, b[i].second -= 1;
            lst[b[i].second] = i;
        }
        vector<vector<int>> pos(m + 1);
        for (int i = 0; i < n; i++)
            pos[lst[i] + 1].push_back(i);

        long long ans = 0, remain = 0;
        int pre = 0;
        for (int i = 0, j = 0; i < m; i++)
        {
            j = max(i, j);
            for (auto &id : pos[i])
                remain += a[id], a[id] = 0;
            while (pre < b[i].first)
            {
                if (j < m)
                {
                    int id = b[j].second;
                    int tmp = b[i].first - pre;
                    int u = min(tmp, a[id]);
                    ans += u, a[id] -= u, pre += u;
                    if (pre == b[i].first)
                        break;
                    j += 1;
                }
                else if (remain)
                {
                    int tmp = b[i].first - pre;
                    int u = min(1ll * tmp, remain);
                    ans += u, remain -= u, pre += u;
                    if (pre == b[i].first)
                        break;
                }
                else
                    break;
            }
            if (pre < b[i].first)
                break;
            a[b[i].second] = c[b[i].second];
        }
        ans += remain;
        for (int i = 0; i < n; i++)
            ans += a[i];
        cout << ans << '\n';
    }
}