#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exponent, long long modulus);
long long choose(long long n, long long k);
long long inverse(long long a, long long m);
void build();
void fileio();
long long ncr(long long n, long long r);
const int nax = 1e6 + 10;
const int LG = log2(nax) + 1;
vector<long long> fact(nax);
map<long long, long long> freq;
vector<long long> tree(4 * nax), tree2(4 * nax);
void update(long long node, long long nl, long long nr, long long ind,
            long long ele, vector<long long> &tree) {
  if (nl == nr) {
    tree[node] = ele;
    return;
  }
  long long mid = (nl + nr) / 2;
  if (nl <= ind && ind <= mid)
    update(2 * node + 1, nl, mid, ind, ele, tree);
  else
    update(2 * node + 2, mid + 1, nr, ind, ele, tree);
  tree[node] = max(tree[2 * node + 1], tree[2 * node + 2]);
}
long long querry(long long node, long long nl, long long nr, long long l,
                 long long r, vector<long long> &tree) {
  if (l > r || nl > nr || l > nr || nl > r) return 0;
  if (l <= nl && nr <= r) return tree[node];
  long long mid = (nl + nr) / 2;
  long long p1 = querry(2 * node + 1, nl, mid, l, r, tree);
  long long p2 = querry(2 * node + 2, mid + 1, nr, l, r, tree);
  return max(p1, p2);
}
void update2(long long node, long long nl, long long nr, long long ind,
             long long ele, vector<long long> &tree) {
  if (nl == nr) {
    tree2[node] = ele;
    return;
  }
  long long mid = (nl + nr) / 2;
  if (nl <= ind && ind <= mid)
    update2(2 * node + 1, nl, mid, ind, ele, tree);
  else
    update2(2 * node + 2, mid + 1, nr, ind, ele, tree);
  tree2[node] = min(tree2[2 * node + 1], tree2[2 * node + 2]);
}
long long querry2(long long node, long long nl, long long nr, long long l,
                  long long r, vector<long long> &tree) {
  if (l > r || nl > nr || l > nr || nl > r) return 1000000000000000;
  if (l <= nl && nr <= r) return tree2[node];
  long long mid = (nl + nr) / 2;
  long long p1 = querry2(2 * node + 1, nl, mid, l, r, tree);
  long long p2 = querry2(2 * node + 2, mid + 1, nr, l, r, tree);
  return min(p1, p2);
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    freq.clear();
    long long n;
    cin >> n;
    long long maxmon = 0;
    vector<long long> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      maxmon = max(maxmon, a[i]);
    }
    long long m;
    cin >> m;
    vector<pair<long long, long long> > b(m);
    long long maxhero = 0;
    for (int i = 0; i < m; i++) {
      cin >> b[i].first >> b[i].second;
      maxhero = max(maxhero, b[i].first);
    }
    if (maxhero < maxmon) {
      cout << -1 << '\n';
      continue;
    }
    for (int i = 0; i <= 4 * n; i++) {
      tree[i] = 0;
      tree2[i] = 1000000000000000;
    }
    sort(b.begin(), b.end());
    reverse(b.begin(), b.end());
    long long maxi = 0;
    for (int i = 0; i < m; i++) {
      maxi = max(maxi, b[i].second);
      freq[b[i].first] = maxi;
    }
    a.push_back(0);
    for (int i = 0; i <= n; i++) update(0, 0, n, i, a[i], tree);
    vector<long long> dp(n + 1, 0);
    update2(0, 0, n, n, 0, tree2);
    for (int i = n - 1; i >= 0; i--) {
      long long low = i, high = n;
      long long ans = -1;
      while (low <= high) {
        long long mid = (low + high) / 2;
        long long maxi = querry(0, 0, n, i, mid, tree);
        auto it = freq.lower_bound(maxi);
        long long endu = it->second;
        if (endu >= (mid - i + 1)) {
          ans = mid;
          low = mid + 1;
        } else {
          high = mid - 1;
        }
      }
      dp[i] = querry2(0, 0, n, i + 1, ans + 1, tree2) + 1;
      update2(0, 0, n, i, dp[i], tree2);
    }
    cout << dp[0] << '\n';
  }
  return 0;
}
long long ncr(long long n, long long r) {
  if (r > n || r < 0 || n < 0) return 0;
  long long ans = fact[n];
  long long temp = (fact[n - r] * fact[r]) % 1000000007;
  ans = (ans * inverse(temp, 1000000007)) % 1000000007;
  return ans;
}
void fileio() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
void build() {
  fact[0] = 1;
  for (long long i = 1; i < nax; i++) fact[i] = (fact[i - 1] * i) % 1000000007;
}
long long modulo(long long base, long long exponent, long long modulus) {
  if (modulus == 1) return 0;
  long long result = 1;
  base = base % modulus;
  while (exponent > 0) {
    if (exponent % 2 == 1) {
      result = (result * base) % modulus;
    }
    exponent = exponent >> 1;
    base = (base * base) % modulus;
  }
  return result;
}
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
void EE(long long a, long long b, long long &co1, long long &co2) {
  if (a % b == 0) {
    co1 = 0;
    co2 = 1;
    return;
  }
  EE(b, a % b, co1, co2);
  long long temp = co1;
  co1 = co2;
  co2 = temp - co2 * (a / b);
}
long long inverse(long long a, long long m) {
  long long x, y;
  EE(a, m, x, y);
  if (x < 0) x += m;
  return x;
}
