#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.141592653589793238463;
const int N = 2e5 + 10;
const long long INF = 1LL << 60;
template <class T>
void chmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, T b) {
  if (a > b) a = b;
}
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &second) { return '"' + second + '"'; }
string to_string(const char *second) { return to_string((string)second); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << to_string(H) << endl;
  debug_out(T...);
}
void solve() {
  long long arr[N];
  long long n;
  cin >> n;
  vector<long long> a(n);
  long long maxd = 0;
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
    chmax(maxd, a[i]);
  }
  long long m;
  cin >> m;
  vector<pair<long long, long long>> vp;
  for (long long i = 0; i < m; ++i) {
    long long p, l;
    cin >> p >> l;
    vp.emplace_back(l, p);
  }
  sort(vp.begin(), vp.end(), greater<pair<long long, long long>>());
  long long curr = 0;
  long long maxp = 0;
  for (long long i = n; i >= 0; --i) {
    while (true) {
      if (curr >= vp.size()) break;
      auto x = vp[curr];
      if (x.first == i) {
        chmax(maxp, x.second);
        curr++;
      } else
        break;
    }
    arr[i] = maxp;
  }
  if (maxp < maxd) {
    cout << -1 << endl;
    return;
  }
  maxd = 0;
  long long len = 0;
  long long ans = 0;
  long long i = 0;
  while (i < n) {
    chmax(maxd, a[i]);
    len++;
    if (arr[len] < maxd) {
      ans++;
      len = 0;
      maxd = 0;
    } else
      i++;
  }
  cout << ans + 1 << endl;
}
int main() {
  long long Tests = 1;
  cin >> Tests;
  while (Tests--) {
    solve();
  }
  return 0;
}
