#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e3 + 10, M = 1e6 + 10;
int h[N], e[M], ne[M], w[M], idx = 2;
int n, m, s, t, d[N], cur[N];
void add(int a, int b, int c)
{
    e[idx] = b, ne[idx] = h[a], w[idx] = c, h[a] = idx++;
    e[idx] = a, ne[idx] = h[b], w[idx] = 0, h[b] = idx++;
}

bool bfs()
{
    memset(d, 0, sizeof d);
    queue<int>q;
    q.push(s), d[s] = 1;
    while (!q.empty())
    {
        int u = q.front(); q.pop();
        for (int i = h[u]; i; i = ne[i])
        {
            int v = e[i];
            if (d[v] == 0 && w[i])
            {
                d[v] = d[u] + 1;
                q.push(v);
                if (v == t)return 1;
            }
        }
    }
    return 0;
}

ll dfs(int u, ll mf)
{
    if (u == t)return mf;
    ll sum = 0;
    for (int i = cur[u]; i; i = ne[i])
    {
        cur[u] = i;
        int v = e[i];
        if (d[v] == d[u] + 1 && w[i])
        {
            ll f = dfs(v, min(mf, 1ll * w[i]));
            sum += f;
            mf -= f;
            w[i] -= f;
            w[i ^ 1] += f;
            if (mf == 0)break;
        }
    }
    if (sum == 0)d[u] = 0;
    return sum;
}

int r[N], c[N];
bool vis[N];

void solve()
{
    cin >> n;
    map<int, vector<int>>hr, hc;
    for (int i = 1; i <= n; i++)cin >> r[i] >> c[i], hr[r[i]].push_back(c[i]), hc[c[i]].push_back(r[i]);
    vector<array<int, 3>>rn, cn;
    cin >> m;
    while (m--)
    {
        int r, c; cin >> r >> c;
        hr[r].push_back(c), hc[c].push_back(r);
    }
    for (auto& [v, k] : hr)sort(k.begin(), k.end());
    for (auto& [v, k] : hc)sort(k.begin(), k.end());
    for (int i = 1; i <= n; i++)
    {
        for (int j = i + 1; j <= n; j++)
        {
            if (r[i] == r[j]) {
                if (abs(c[i] - c[j]) == 1) {
                    cout << -1 << '\n';
                    return;
                }
                auto& v = hr[r[i]];
                auto it = upper_bound(v.begin(), v.end(), min(c[i], c[j]));
                if (it != v.end() && (*it) == max(c[i], c[j])) {
                    rn.push_back({r[i], min(c[i], c[j]) + 1, max(c[i], c[j]) - 1 });
                }
            }
            if (c[i] == c[j]) {
                if (abs(r[i] - r[j]) == 1) {
                    cout << -1 << '\n';
                    return;
                }
                auto& v = hc[c[i]];
                auto it = upper_bound(v.begin(), v.end(), min(r[i], r[j]));
                if (it != v.end() && (*it) == max(r[i], r[j])) {
                    cn.push_back({c[i], min(r[i], r[j]) + 1, max(r[i], r[j]) - 1 });
                }
            }
        }
    }

    int tot = rn.size() + cn.size(); idx = 2;
    for (int i = 1; i <= tot + 2; i++)h[i] = 0, vis[i] = 0;
    s = tot + 1, t = s + 1;
    for (int i = 0; i < cn.size(); i++)add(i + 1 + rn.size(), t, 1);
    for (int i = 0; i < rn.size(); i++)
    {
        add(s, i + 1, 1);
        for (int j = 0; j < cn.size(); j++) {
            auto [x, l1, r1] = rn[i];
            auto [y, l2, r2] = cn[j];
            if (x >= l2 && x <= r2 && y >= l1 && y <= r1)add(i + 1, j + 1 + rn.size(), 1);
        }
    }
    int ans = tot;
    while (bfs())
    {
        memcpy(cur, h, sizeof h);
        ans -= dfs(s, 1e18);
    }
    cout << ans << '\n';
    for (int i = 2; i < idx; i += 2)
    {
        int u = e[i], v = e[i ^ 1];
        if (u <= tot && v <= tot)
        {
            if (w[i] == 0) {
                if (u >= rn.size())swap(u, v);
                auto [x, l1, r1] = rn[u - 1];
                auto [y, l2, r2] = cn[v - 1 - rn.size()];
                cout << x << ' ' << y << '\n';
                vis[u] = vis[v] = 1;
            }
        }
    }
    for (int i = 0; i < rn.size(); i++)
    {
        if (vis[i + 1])continue;
        auto [x, l1, r1] = rn[i];
        cout << x << ' ' << l1 << '\n';
    }
    for (int i = 0; i < cn.size(); i++)
    {
        if (vis[i + 1])continue;
        auto [y, l1, r1] = cn[i];
        cout << l1 << ' ' << y << '\n';
    }
}

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