#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")



int N;
vector<int> A;

int solve() {
// cerr<<"[solve] N = "<<N<<", A = "<<A<<endl;
  using Pair = pair<int, int>;
  priority_queue<Pair, vector<Pair>, greater<Pair>> queMin;
  priority_queue<Pair> queMax;
  auto as = A;
  for (int i = 0; i < N; ++i) {
    queMin.emplace(A[i], i);
    queMax.emplace(A[i], i);
  }
  vector<int> js(N - 1, -1);
  vector<int> eaten(N, N - 1);
  for (int t = 0; t < N - 1; ++t) {
    int i = -1, j = -1;
    for (; ; ) {
      const int a = queMin.top().first;
      i = queMin.top().second;
      queMin.pop();
      if (a == as[i]) break;
    }
    for (; ; ) {
      const int a = queMax.top().first;
      j = queMax.top().second;
      queMax.pop();
      if (a == as[j]) break;
    }
    js[t] = j;
    eaten[i] = t;
    as[j] -= as[i];
    queMin.emplace(as[j], j);
    queMax.emplace(as[j], j);
  }
  // i: alive if eaten[i] >= alive
  int alive = N - 1;
  for (int t = N - 1; --t >= 0; ) {
    if (eaten[js[t]] < alive) {
      // resurrect all
      alive = t;
    }
  }
  return N - alive;
}

int main() {
  int T;
  for (; ~scanf("%d", &T); ) {
    scanf("%d", &N);
    A.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    for (int t = 0; t < T; ++t) {
      if (t) {
        int K;
        scanf("%d", &K);
        for (; K--; ) {
          int X, Y;
          scanf("%d%d", &X, &Y);
          --X;
          A[X] = Y;
        }
      }
      const int ans = solve();
      printf("%d\n", ans);
    }
  }
  return 0;
}