#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <numeric>

#define ll              long long 
#define all(v)          v.begin(),v.end()
#define ld              long double
#define pll             std::pair<ll,ll>
#define pi              std::pair<int,int>
#define vi              std::vector<int>
#define vll             std::vector<ll>
#define len(x)          (int)x.size()
#define vec(T)          std::vector<T>


template<typename T, typename = void>
struct is_printable : std::false_type {};

template<typename T>
struct is_printable<T, std::void_t<decltype(std::declval<std::ostream&>() << std::declval<T>())>> : std::true_type {};
template <typename T>
void print(const std::pair<T, T>& pair) {
    std::cout << "(" << pair.first << ", " << pair.second << ")";
}

// General print function
template <typename T>
void print(const T& val) {
    std::cout << val;
}

// Print function for std::vector
template <typename T>
void print(const std::vector<T>& vec) {
    std::cout << '[';
    int n = vec.size();
    for (int i = 0; i < n; i++) {
        print(vec[i]);
        if (i < n - 1) {
            std::cout << ",";
        }
    }
    std::cout << ']' << '\n';
}

// Variadic template print function
template<typename T, typename... Args>
void print(const T& t, const Args&... args) {
    print(t);
    std::cout << (is_printable<T>::value ? ' ' : '\0');
    print(args...);
    if (sizeof...(args) == 1 && is_printable<T>::value) std::cout << '\n';

}

void solve(){
    int n, m;
    std::cin >> n >> m;
    vll a(n), x(n), t(n), fuel(n);
    vec(std::deque<int>) mp(n);
    std::priority_queue<pll, vec(pll), std::greater<pll>> pq;
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    fuel = a;
    for (int i = 0; i < m; i++) {
        std::cin >> x[i] >> t[i];
        mp[--t[i]].push_back(x[i]);
    }
    for (int i = 0; i < n; i++) {
        mp[i].push_back(2e9);
        pq.push({mp[i].front(), i});
    }
    int cur = 0;
    for (int i = 0; i < m; i++) {
        while (!pq.empty() && cur < x[i]) {
            auto [_, ind] = std::move(pq.top());
            pq.pop();
            ll tmp = std::min(cur + a[ind], x[i]);
            a[ind] -= tmp - cur;
            cur = tmp;
            if (a[ind] && mp[ind].front() > x[i]) {
                pq.push({mp[ind].front(), ind});
            }
        }
        if (cur < x[i]) break;
        if (mp[t[i]].size() > 1) mp[t[i]].pop_front();
        a[t[i]] = fuel[t[i]];
        pq.push({mp[t[i]].front(), t[i]});
    }
    for (int i = 0; i < n; i++) {
        cur += a[i];
    }
    std::cout << cur << std::endl;



    

}
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t = 1;
    std::cin >> t;
    while (t--) solve();
}