#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

const ll INF = 0x3f3f3f3f3f3f3f3f;
void solve() {
	ll m;
	scanf("%lld", &m);
	vector<ll> a(m), b(m);
	ll sum_a = 0, sum_b = 0;
	for(auto &g: a) scanf("%lld", &g), sum_a += g;
	for(auto &g: b) scanf("%lld", &g), sum_b += g;
	a[0] += max(sum_a, sum_b) - sum_a;
	b[0] += max(sum_a, sum_b) - sum_b;
	ll ans = 0, has_carry = false;
	stack<pll> stk;
	ll min_a = INF, min_b = INF, max_a = -1, max_b = -1;
	rep(i,0,m) {
		stk.emplace(m-1-i, b[m-1-i]);
		// cout<<"#"<<i<<endl;
		while(!stk.empty() && a[i] > 0) {
			auto [pos, amount] = stk.top();
			ll take = min(amount, a[i]);
			// cout<<pos<<" "<<amount<<"  "<<take<<endl;
			ans += take;
			a[i] -= take;
			b[pos] -= take;
			stk.pop();
			if(amount > take) {
				// cout<<"#F"<<pos<<"  "<<amount-take<<endl;
				stk.emplace(pos, amount-take);
			}
			min_a = min(min_a, i);
			min_b = min(min_b, pos);
			max_a = max(max_a, i);
			max_b = max(max_b, pos);
			if(i + pos >= m) {
				has_carry = true;
			}
		}
	}
	// cout<<"C"<<has_carry<<endl;
	if(!has_carry) {
		bool good = false;
		rep(i,0,m) {
			if(a[i] > 0 && i > min_a) good = true;
			if(b[i] > 0 && i > min_b) good = true;
		}
		if(!good) {
			if(min_a == INF || min_b == INF || max_a == -1 || max_b == -1) {
				assert(min_a == INF && min_b == INF && max_a == -1 && max_b == -1);
				assert(ans == 0);
			} else if(min_a == max_a && min_b == max_b) {
				bool ok = false;
				rep(i,min_a+1,m) if(a[i] > 0) {
					ok = true;
				}
				rep(i,min_b+1,m) if(b[i]>0) ok=true;
				if(!ok)	ans = 0;
			} else {
				// assert(min_a < max_b && min_b < max_b);
				bool ok = false;
				rep(i,min_a+1,m) if(a[i] > 0) ok = true;
				rep(i,min_b+1,m) if(b[i] > 0) ok = true;
				if(!ok) ans--;
			}
		}
	}
	cout<<ans<<'\n';
}
int main() {
	int T;
	scanf("%d", &T);
	while(T--) solve();
	return 0;
}