// test
#include <bits/stdc++.h>

typedef long long s64;

const int N = 100100;

int n, m;
int a[N], b[N];

std::priority_queue< std::pair<int, int> > q;

int pos[N], id[N];

int fir[N];
int lst[N], net[N];

void work() {
    scanf("%d%d", &n, &m);

    for (int i = 1; i <= n; i ++) scanf("%d", &a[i]);

    for (int i = 1; i <= n; i ++) b[i] = a[i];

    for (int i = 1; i <= n; i ++) fir[i] = lst[i] = net[i] = 0;
    for (int i = 1; i <= m; i ++) {
        scanf("%d%d", &pos[i], &id[i]);

        int u = id[i];
        if (!fir[u]) {
            fir[u] = i;
        } else {
            net[lst[u]] = i;
        }

        lst[u] = i;
        net[i] = m + 1;
    }

    while (q.size()) q.pop();

    for (int i = 1; i <= n; i ++)
        if (fir[i])
            q.push(std::make_pair(-fir[i], i));
        else
            q.push(std::make_pair(-m - 1, i));

    s64 walk = 0;
    for (int i = 0; i < m; i ++) {
        int delta = pos[i + 1] - pos[i];

        while (delta && q.size()) {
            std::pair<int, int> now = q.top();
            int x = now.second;

            if (delta >= b[x]) {
                walk += b[x];
                delta -= b[x], b[x] = 0;
                q.pop();
            } else {
                walk += delta;
                b[x] -= delta, delta = 0;
            }
        }

        if (delta) {
            printf("%lld\n", walk);
            return;
        }

        if (q.top().first == -i - 1) q.pop();

        // for (int x = 1; x <= n; x ++)
        //     printf(" %d", b[x]);
        // puts("");

        b[id[i + 1]] = a[id[i + 1]];
        q.push(std::make_pair(-net[i + 1], id[i + 1]));
    }

    while (q.size()) {
        int x = q.top().second; q.pop();
        walk += b[x];
    }

    printf("%lld\n", walk);
}

int main() {
    int T;
    scanf("%d", &T);

    while (T --)
        work();
    
    return 0;
}