#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline void chkmin(T1 &a, T2 b) {
  if (a > b) a = b;
}
template <typename T1, typename T2>
inline void chkmax(T1 &a, T2 b) {
  if (a < b) a = b;
}
using ll = long long;
using ld = long double;
const string FILENAME = "input";
const int MAXN = 1005;
int h;
int l[MAXN];
int v;
int p[MAXN];
bitset<1000228> can[MAXN];
void solve() {
  cin >> h;
  int sum = 0;
  for (int i = 0; i < h; i++) {
    cin >> l[i];
    sum += l[i];
  }
  cin >> v;
  int sum1 = 0;
  for (int i = 0; i < v; i++) {
    cin >> p[i];
    sum1 += p[i];
  }
  if (h != v || sum & 1 || sum1 & 1) {
    cout << "No\n";
    return;
  }
  can[0].reset();
  can[0][0] = true;
  for (int i = 0; i < h; i++) {
    can[i + 1] = (can[i] << l[i]) | can[i];
  }
  if (!can[h][sum >> 1]) {
    cout << "No\n";
    return;
  }
  int need = sum / 2;
  vector<int> st, st1;
  for (int i = h; i >= 1; i--) {
    if (need >= l[i - 1] && can[i - 1][need - l[i - 1]]) {
      st.push_back(l[i - 1]);
      need -= l[i - 1];
    } else {
      st1.push_back(l[i - 1]);
    }
  }
  can[0].reset();
  can[0][0] = true;
  for (int i = 0; i < v; i++) {
    can[i + 1] = (can[i] << p[i]) | can[i];
  }
  if (!can[v][sum1 >> 1]) {
    cout << "No\n";
    return;
  }
  need = sum1 / 2;
  vector<int> st2, st3;
  for (int i = v; i >= 1; i--) {
    if (need >= p[i - 1] && can[i - 1][need - p[i - 1]]) {
      st2.push_back(p[i - 1]);
      need -= p[i - 1];
    } else {
      st3.push_back(p[i - 1]);
    }
  }
  sort((st).begin(), (st).end());
  sort((st1).begin(), (st1).end());
  sort((st2).begin(), (st2).end());
  sort((st3).begin(), (st3).end());
  if ((int)(st).size() < (int)(st1).size()) {
    swap(st, st1);
  }
  if ((int)(st2).size() < (int)(st3).size()) {
    swap(st2, st3);
  }
  cout << "Yes\n";
  if ((int)(st).size() > (int)(st2).size()) {
    reverse((st2).begin(), (st2).end());
    reverse((st1).begin(), (st1).end());
    reverse((st).begin(), (st).end());
    int cx = 0;
    int cy = 0;
    for (int i = 0; i < (int)(st2).size(); i++) {
      cy += st2[i];
      cout << cx << ' ' << cy << '\n';
      cx += st.back();
      cout << cx << ' ' << cy << '\n';
      st.pop_back();
    }
    for (int i = 0; i < (int)(st3).size(); i++) {
      cy -= st3[i];
      cout << cx << ' ' << cy << '\n';
      if (!st.empty()) {
        cx += st.back();
        cout << cx << ' ' << cy << '\n';
        st.pop_back();
      } else {
        cx -= st1.back();
        cout << cx << ' ' << cy << '\n';
        st1.pop_back();
      }
    }
  } else {
    reverse((st).begin(), (st).end());
    reverse((st3).begin(), (st3).end());
    reverse((st2).begin(), (st2).end());
    int cx = 0;
    int cy = 0;
    for (int i = 0; i < (int)(st).size(); i++) {
      cx += st[i];
      cout << cx << ' ' << cy << '\n';
      cy += st2.back();
      cout << cx << ' ' << cy << '\n';
      st2.pop_back();
    }
    for (int i = 0; i < (int)(st1).size(); i++) {
      cx -= st1[i];
      cout << cx << ' ' << cy << '\n';
      if (!st2.empty()) {
        cy += st2.back();
        cout << cx << ' ' << cy << '\n';
        st2.pop_back();
      } else {
        cy -= st3.back();
        cout << cx << ' ' << cy << '\n';
        st3.pop_back();
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
