code1469B.cpp

/*
 * Contest : Codeforces
 * Problem : 1469B - Red and Blue
 * Link    : https://codeforces.com/contest/1469/problem/B
 */

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define fastio ios::sync_with_stdio(0); cin.tie(0);

int main() {
  fastio

  ios::sync_with_stdio(0);
  cin.tie(0);

  int tc, n, m; cin >> tc;
  while (tc--) {
    cin >> n;
    vector<int> r(n), prefR(n + 1, 0);

    for (int i = 0; i < n; i++) {
      cin >> r[i];

      prefR[i + 1] = prefR[i] + r[i];
    }

    cin >> m;
    vector<int> b(m), prefB(m + 1, 0);

    for (int i = 0; i < m; i++) {
      cin >> b[i];

      prefB[i + 1] = prefB[i] + b[i];
    }

    cout << *max_element(prefR.begin(), prefR.end()) + *max_element(prefB.begin(), prefB.end()) << endl;
  }

  return 0;
}