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

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int64_t> bat(n);
    for (auto &it : bat)
        cin >> it;
    int64_t cap = accumulate(bat.begin(), bat.end(), 0ll);
    using P = array<int64_t, 2>;
    vector<P> st(m);
    for (auto &[x, t] : st)
        cin >> x >> t;
    vector<int64_t> pos(n);
    int64_t pre = 0, res = 0, cost = 0;
    for (auto [x, t] : st)
    {
        cost += x - pre;
        if (cost > cap)
        {
            cost -= x - pre;
            break;
        }
        auto w = x - pos[t - 1];
        cost -= min(w, bat[t - 1]);
        cost = max(cost, 0ll);
        pre = x;
        pos[t - 1] = x;
    }
    res = pre + (cap - cost);
    cout << res << '\n';
}

int main()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
    auto _ = clock();
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--)
        solve();
#ifdef LOCAL
    cerr << clock() - _ << '\n';
#endif
    return 0;
}

answer.code: In function ‘void solve()’:
answer.code:28:19: error: no matching function for call to ‘max(int64_t&, long long int)’
   28 |         cost = max(cost, 0ll);
      |                ~~~^~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from answer.code:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: ‘template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)’
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
answer.code:28:19: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long int’ and ‘long long int’)
   28 |         cost = max(cost, 0ll);
      |                ~~~^~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: ‘template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)’
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
answer.code:28:19: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long int’ and ‘long long int’)
   28 |         cost = max(cost, 0ll);
      |                ~~~^~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: ‘template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)’
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
answer.code:28:19: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long int’
   28 |         cost = max(cost, 0ll);
      |                ~~~^~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: ‘template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)’
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
answer.code:28:19: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long int’
   28 |         cost = max(cost, 0ll);
      |                ~~~^~~~~~~~~~~