#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while ((c < '0' || c > '9') && (c != '-')) c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * f;
}
const int N = 1010;
int n, m, a[N], b[N];
bitset<N * N / 2> f[N];
vector<int> va[2], vb[N];
inline void solve() {
  n = read();
  int sa = 0;
  for (register int i = (1); i <= (n); i++) a[i] = read(), sa += a[i];
  m = read();
  int sb = 0;
  for (register int i = (1); i <= (m); i++) b[i] = read(), sb += b[i];
  if (n != m || sa % 2 || sb % 2) return puts("No"), void(0);
  {
    f[0][0] = 1;
    for (register int i = (1); i <= (n); i++)
      f[i] = f[i - 1] | (f[i - 1] << a[i]);
    if (!f[n][sa / 2]) return puts("No"), void(0);
    int now = sa / 2;
    va[0].clear(), va[1].clear();
    for (register int i = (n); i >= (1); i--) {
      if (now >= a[i] && f[i - 1][now - a[i]])
        now -= a[i], va[1].push_back(a[i]);
      else
        va[0].push_back(a[i]);
    }
    sort((va[0]).begin(), (va[0]).end()), sort((va[1]).begin(), (va[1]).end());
    reverse((va[0]).begin(), (va[0]).end()),
        reverse((va[1]).begin(), (va[1]).end());
  }
  {
    f[0][0] = 1;
    for (register int i = (1); i <= (m); i++)
      f[i] = f[i - 1] | (f[i - 1] << b[i]);
    if (!f[m][sb / 2]) return puts("No"), void(0);
    int now = sb / 2;
    vb[0].clear(), vb[1].clear();
    for (register int i = (m); i >= (1); i--) {
      if (now >= b[i] && f[i - 1][now - b[i]])
        now -= b[i], vb[1].push_back(b[i]);
      else
        vb[0].push_back(b[i]);
    }
    sort((vb[0]).begin(), (vb[0]).end()), sort((vb[1]).begin(), (vb[1]).end());
  }
  if (((int)(va[0]).size()) > ((int)(va[1]).size())) swap(va[0], va[1]);
  if (((int)(vb[0]).size()) < ((int)(vb[1]).size())) swap(vb[0], vb[1]);
  puts("Yes");
  int x = 0, y = 0, la = 0, lb = 0;
  for (register int i = (1); i <= (2 * n); i++) {
    if (i & 1) {
      if (la < ((int)(va[0]).size()))
        x += va[0][la], ++la;
      else
        x -= va[1][la - ((int)(va[0]).size())], ++la;
    } else {
      if (lb < ((int)(vb[0]).size()))
        y += vb[0][lb], ++lb;
      else
        y -= vb[1][lb - ((int)(vb[0]).size())], ++lb;
    }
    printf("%d %d\n", x, y);
  }
}
int main() {
  int T = read();
  while (T--) solve();
}
