#include <bits/stdc++.h>
using namespace std;
void te() {
	int n;
	scanf("%d", &n);
	vector<int> a(n), b(n);
	for(int i = 0; i < n; ++i)
		scanf("%d", &a[i]);
	for(int i = 0; i < n; ++i)
		scanf("%d", &b[i]);
	long long answer = -1;
	for(int repeat = 0; repeat < 2; ++repeat) {
		swap(a, b);
		long long maybe = 0;
		for(int i = 0; i < n; ++i)
			maybe += i % 2 ? a[i] : b[i];
		if(answer == -1 || answer > maybe)
			answer = maybe;
	}
	printf("%lld\n", answer);
}
int main() {
	int T;
	scanf("%d", &T);
	while(T--) te();
}