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

typedef long long ll;

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> vis(n + 1);
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    vector<pair<int, int>> f(m + 1);
    vector<queue<int>> pos(n + 1);
    for (int i = 1; i <= m; ++i)
    {
        int x, t;
        cin >> x >> t;
        pos[t].push(i);
        f[i] = {x, t};
    }

    set<array<int, 2>> s;
    for (int i = 1; i <= m; i++)
    {
        auto [x, t] = f[i];
        if (!vis[t])
        {
            vis[t] = 1;
            s.insert({i, a[t]});
        }
    }

    ll sheng = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!vis[i])
            sheng += a[i];
    }

    ll start = 0; // 车停留的位置
    int del = 0;
    array<int, 2> modify;
    for (int i = 1; i <= m; i++)
    {
        auto [x, t] = f[i];
        int need = x - start;
        del = 0;
        modify[0] = 0;
        // 检查是否能到i
        int res = 0;
        for (auto [id, c] : s)
        {
            del++;
            if (res + c > need)
            {
                modify = {i, c - (need - res)};
                res = need;
                break;
            }
            res += c;
        }
        if (res < need)
        {
            int mi = min(need - res, sheng);
            res += mi;
            sheng -= mi;
        }
        start += res;

        // 不能到
        if (res < need)
            break;

        // 能到
        //  处理充电装
        while (del--)
            s.erase(s.begin());
        if (modify[0])
            s.insert(modify);

        // 后面的一个复活
        pos[t].pop();
        if (pos[t].size())
            s.insert({pos[t].front(), a[t]});
        else
            sheng += a[t];
    }

    // 补刀
    start += sheng;

    cout << start << "\n";
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

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

    return 0;
}