#include <bits/stdc++.h>
using namespace std;
int l[1000], p[1000];
bitset<500001> poss[1001];
int main() {
  int i;
  int t, h, v;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &h);
    for (i = 0; i < h; i++) scanf("%d", &l[i]);
    scanf("%d", &v);
    for (i = 0; i < v; i++) scanf("%d", &p[i]);
    if (h != v) {
      printf("No\n");
      continue;
    }
    int sl = 0, sp = 0;
    for (i = 0; i < h; i++) sl += l[i], sp += p[i];
    if ((sl & 1) || (sp & 1)) {
      printf("No\n");
      continue;
    }
    poss[0][0] = 1;
    for (i = 0; i < h; i++) poss[i + 1] = poss[i] | (poss[i] << l[i]);
    if (!poss[h][sl / 2]) {
      printf("No\n");
      continue;
    }
    int u = sl / 2;
    vector<int> ll, pp;
    for (i = h - 1; i >= 0; i--) {
      if ((u >= l[i]) && poss[i][u - l[i]])
        ll.push_back(l[i]), u -= l[i];
      else
        ll.push_back(-l[i]);
    }
    poss[0][0] = 1;
    for (i = 0; i < h; i++) poss[i + 1] = poss[i] | (poss[i] << p[i]);
    if (!poss[h][sp / 2]) {
      printf("No\n");
      continue;
    }
    u = sp / 2;
    for (i = h - 1; i >= 0; i--) {
      if ((u >= p[i]) && poss[i][u - p[i]])
        pp.push_back(p[i]), u -= p[i];
      else
        pp.push_back(-p[i]);
    }
    int pos1 = 0, pos2 = 0;
    for (i = 0; i < ll.size(); i++) {
      if (ll[i] > 0) pos1++;
    }
    for (i = 0; i < pp.size(); i++) {
      if (pp[i] > 0) pos2++;
    }
    int s = 0;
    if (pos1 > pos2) swap(ll, pp), s = 1;
    sort(pp.begin(), pp.end(), greater<int>());
    for (i = 0; i < pp.size(); i++) {
      if (pp[i] < 0) {
        reverse(pp.begin(), pp.begin() + i);
        break;
      }
    }
    sort(ll.begin(), ll.end(), greater<int>());
    for (i = 0; i < ll.size(); i++) {
      if (ll[i] < 0) {
        reverse(ll.begin() + i, ll.end());
        break;
      }
    }
    printf("Yes\n");
    int x = 0, y = 0;
    for (i = 0; i < h + v; i++) {
      if (i & 1)
        y += pp[i / 2];
      else
        x += ll[i / 2];
      if (s)
        printf("%d %d\n", y, x);
      else
        printf("%d %d\n", x, y);
    }
  }
  return 0;
}
