#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define close ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
const int N = 1e6;
int fi[N];
int ne[N];
int ls[N];
int val[N];
int c[N];
int pos[N];
int num[N];
void solved()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fi[i] = m + 1;
        ne[i] = ls[i] = 0;
        cin >> val[i];
        c[i] = val[i];
    }
    for (int i = 1; i <= m; i++)
    {
        cin >> pos[i] >> num[i];
    }
    for (int i = 1; i <= m; i++)
    {
        int id = num[i];
        if (fi[id] == m + 1)
        {
            fi[id] = i;
        }
        if (ls[i])
        {
            ne[ls[i]] = i;
        }
        ls[i] = i;
    }
    for (int i = 1; i <= n; i++)
    {
        if (ls[i])
        {
            ne[ls[i]] = m + 1;
        }
    }
    set<array<int, 2>> st;
    for (int i = 1; i <= n; i++)
    {
        st.insert({fi[i], i});
    }
    int ans = 0;
    for (int i = 1; i <= m; i++)
    {
        int dis = pos[i] - pos[i - 1];
        while (!st.empty() && c[(*st.begin())[1]] <= dis)
        {
            int id = (*st.begin())[1];
            int value = c[id];
            dis -= value;
            ans += value;
            c[id] = 0;
            st.erase(st.begin());
        }
        if (st.empty() && dis > 0)
        {
            cout << ans << endl;
            return;
        }
        c[(*st.begin())[1]] -= dis;
        ans += dis;
        c[num[i]] = val[num[i]];
        auto place = st.find({i, num[i]});
        if (place != st.end())
        {
            st.erase(place);
        }
        int nePlace = ne[i];
        st.insert({nePlace, num[i]});
    }
    for (int i = 1; i <= n; i++)
    {
        ans += c[i];
    }
    cout << ans << endl;
}

signed main()
{
    close;
    int T;
    cin >> T;
    while (T--)
    {
        solved();
    }
}