#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long 
#define vi vector < int > 
#define sz(a) ((int) (a).size())
#define ll long long 
#define ull unsigned long long
#define me(a, x) memset(a, x, sizeof(a)) 
using namespace std;
const int N = 1 << 20;
int n, a[2][N];
void Main() {
	cin >> n;
	L(o, 0, 1) {
		L(i, 1, n) {
			cin >> a[o][i];
		}
	}
	ll ans = 0;
	ll sum = 0;
	L(o, 0, 1) L(i, 1, n / 2) sum += a[o][i];
	ans = sum, sum = 0;
	L(i, 1, n) sum += a[0][i];
	ans = max(ans, sum), sum = 0;
	if(n > 1) {
		L(o, 0, 1) L(i, 1, n / 2 + 1) sum += a[o][i];
	}
	ans = min(ans, sum);
	cout << ans << '\n';
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}
/*
4
2
1 4
2 1
3
1 1 4
5 1 4
4
1 9 4 9 
1 0 0 1
7
3 1 4 1 5 9 2
6 5 3 5 8 9  8
*/