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

#define int long long  

void solve() {
	int m;
	cin >> m;
	
	int sa = 0, sb = 0;
	vector<int> a(m), b(m);
	for (int i = 0; i < m; i++) {
		cin >> a[i];
		sa += a[i];
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i];
		sb += b[i];
	}

	if (sa > sb) {
		b[0] += sa - sb;
	} else {
		a[0] += sb - sa;
	}

	reverse(b.begin(), b.end());

	int mx = 0;
	auto work = [&]() {
		int ans = 0;
		int s = 0;

		for (int i = 0; i < m; i++) {
			s += b[i];
			if (s >= a[i]) {
				s -= a[i];
				ans += a[i];
			} else {
				ans += s;
				s = 0;
			}
		}	

		// for (int i = 0; i < m; i++) {
		// 	cout << a[i] << " \n"[i + 1 == m];
		// }
		// for (int i = 0; i < m; i++) {
		// 	cout << b[i] << " \n"[i + 1 == m];
		// }
		// cout << ans << "\n";
		
		return ans;
	};

	for (int i = 0; i < m; i++) {
		for (int j = i + 1; j < m; j++) {
			if (b[i] > 0 && a[j] > 0) {
				a[j]--, b[i]--;
				mx = max(work() + 1, mx);
				a[j]++, b[i]++;
			}
		}
	}

	cout << mx << "\n";
}

signed main() {  
    ios::sync_with_stdio(false);
    cin.tie(nullptr);  

    int t;
    cin >> t;
    while (t--) {
    	solve();
    }

    return 0;
}