#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1, c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  return f == 1 ? x : -x;
}
const int N = 1004;
bitset<N * N> bit[N];
int n, m, sum, a[N], b[N];
vector<int> a1, a2, b1, b2;
inline void solve() {
  a1.clear();
  a2.clear();
  b1.clear();
  b2.clear();
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  m = read();
  for (int i = 1; i <= m; i++) b[i] = read();
  if (n != m) {
    puts("NO");
    return;
  }
  sum = 0;
  bit[0].reset();
  bit[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    sum += a[i];
    bit[i] = bit[i - 1] | (bit[i - 1] << a[i]);
  }
  if ((sum & 1) || !bit[n][sum >> 1]) {
    puts("NO");
    return;
  }
  sum >>= 1;
  for (int i = n; i; i--) {
    if (bit[i - 1][sum])
      a2.push_back(a[i]);
    else {
      a1.push_back(a[i]);
      sum -= a[i];
    }
  }
  if (a1.size() > a2.size()) swap(a1, a2);
  sum = 0;
  bit[0].reset();
  bit[0][0] = 1;
  for (int i = 1; i <= n; i++) {
    sum += b[i];
    bit[i] = bit[i - 1] | (bit[i - 1] << b[i]);
  }
  if ((sum & 1) || !bit[n][sum >> 1]) {
    puts("NO");
    return;
  }
  sum >>= 1;
  for (int i = n; i; i--) {
    if (bit[i - 1][sum])
      b2.push_back(b[i]);
    else {
      b1.push_back(b[i]);
      sum -= b[i];
    }
  }
  if (b1.size() < b2.size()) swap(b1, b2);
  puts("YES");
  sort(a1.begin(), a1.end());
  sort(a2.begin(), a2.end());
  sort(b1.begin(), b1.end());
  sort(b2.begin(), b2.end());
  reverse(b2.begin(), b2.end());
  reverse(b1.begin(), b1.end());
  for (int i = 1, x = 0, y = 0; i <= n; i++) {
    if (a1.empty()) {
      x -= *a2.rbegin();
      a2.pop_back();
    } else {
      x += *a1.rbegin();
      a1.pop_back();
    }
    cout << x << " " << y << "\n";
    if (b1.empty()) {
      y -= *b2.rbegin();
      b2.pop_back();
    } else {
      y += *b1.rbegin();
      b1.pop_back();
    }
    cout << x << " " << y << "\n";
  }
}
int main() {
  for (int T = read(); T--;) solve();
  return (0 - 0);
}
