/*Author -> SAMBHU SHOW
Jalpaiguri Govt. Engineering College */
#include<bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define itc ll t;cin>>t;while(t--)
#define PI 3.141592653589793238
#define Max(a,b,c) max(a,max(b,c));
#define Min(a,b,c) min(a,min(b,c));
#define all(v) v.begin(),v.end()
#define ll long long int
#define ld long double
#define pb push_back
#define eb emplace_back
#define gcd(a,b) __gcd(a,b)
#define fi first
#define se second
#define endl "\n"
void solve()
{
	int n;
	cin >> n;

	vector<ll> c(n), a(n), b(n);

	for (int i = 0; i < n; i++)cin >> c[i];
	for (int i = 0; i < n; i++)cin >> a[i];
	for (int i = 0; i < n; i++)cin >> b[i];

	ll tot = c[n - 1];
	ll ans = 0;
	for (int i = n - 1; i >= 1; i--)
	{
		tot += 2;

		if (a[i] < b[i])swap(a[i], b[i]);

		ans = max(ans, tot + (a[i] - b[i] - 1));

		if (a[i] == b[i])
		{
			tot = c[i - 1];
		}
		else //ai != bi
		{
			tot += (b[i] - 1);
			tot += (c[i - 1] - a[i]);
		}

		tot = max(tot, c[i - 1]);
	}

	cout << ans << endl;
}
int main()
{
// #ifndef ONLINE_JUDGE
//  freopen("input.txt", "r", stdin);
//  freopen("output.txt", "w", stdout);
// #endif
	fio
	itc
	solve();
	return 0;
}