#include <bits/stdc++.h>
#define int long long
using namespace std;
#define YES "YES"
#define NO "NO"
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
const double eps = 1e-9;
const int N = 2e6 + 10;
const int M = 2e5 + 10;
const int INF = 1e16 + 100;
const int mod = 998244353;
const int base = 23333;
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
int mx[N], now[N];
int jl[N], id[N];
pii j[N];
vector<int> e[N];
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> flag(n + 5);
    for (int i = 1; i <= n; i++)
    {
        cin >> mx[i];
        now[i] = mx[i];
    }
    set<pii> q;
    for (int i = 1; i <= m; i++)
    {
        cin >> jl[i] >> id[i];
        q.insert({i, id[i]});
        e[id[i]].push_back(i);
        flag[id[i]]++;
    }
    int pre = 0, sy = 0, ans = 0;
    for (int i = 1; i <= n; i++)
    {
        if (!flag[i])
            sy += now[i];
    }
    for (int i = 1; i <= m; i++)
    {
        int ned = jl[i] - pre;
        while (!q.empty() && ned > 0)
        {
            auto [u, v] = *(q.begin());
            // cout << u << ' ' << v << '\n';
            q.erase(q.begin());
            if (now[v] < ned)
            {
                ans += now[v];
                ned -= now[v];
                now[v] = 0;
            }
            else
            {
                ans += ned;
                now[v] -= ned;
                ned = 0;

                if (i == e[id[i]].back())
                    sy += mx[id[i]];
                else
                {
                    auto it = upper_bound(all(e[id[i]]), i);
                    now[id[i]] = mx[id[i]];
                    q.insert({*it, id[i]});
                }
                q.insert({u, v});
            }
        }
        if (ned > sy)
        {
            ans += sy;
            sy = 0;
            break;
        }
        else if (ned > 0)
        {
            ans += ned;
            sy -= ned;
            auto it = upper_bound(all(e[id[i]]), i);
            if (it == e[id[i]].end())
                sy += mx[id[i]];
            else
            {
                now[id[i]] = mx[id[i]];
                q.insert({*it, id[i]});
            }
        }
        pre = jl[i];
    }
    ans += sy;
    cout << ans << '\n';
    for (int i = 1; i <= m; i++)
        e[id[i]].clear();
}
signed main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}