#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define N 500005
#define mod 1000000007
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i,a,b) for(int i=a;i<b;i++)
#define endl "\n"
#define PI 3.14159265358979323846  /* pi */
#define is_pot(n) (n&& !(n&(n-1)))
#define all(v)  ((v).begin()),((v).end())
#define degreesToRadians(angleDegrees) (angleDegrees * PI / 180.0) // Converts degrees to radians.
#define radiansToDegrees(angleRadians) (angleRadians * 180.0 / PI) // Converts radians to degrees.
#define int long long
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define epsilon 1e-9
typedef long long ll;
typedef long double ld;

int dx[]={1, 0, -1, 0};
int dy[]={0, 1, 0, -1};

void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif






void solve()
{
	int n;
	cin>>n;
	int a[n], b[n], c[n];
	rep(i, n)
		cin>>c[i];
	rep(i, n)
		cin>>a[i];
	rep(i, n)
		cin>>b[i];
	//I am the god of blunder
	int dp[n];
	dp[0]=c[0];
	a[1]==b[1]?dp[1]=c[1]+1: dp[1]=c[1]+abs(a[1]-b[1])+1;
	for(int i=2;i<n;i++)
		a[i]==b[i]?dp[i]=c[i]+1: dp[i]=c[i]+max(dp[i-1]-(abs(a[i]-b[i])-1), abs(a[i]-b[i])+1);
	int ans=0;
	for(int i=1;i<n;i++){
		ans=max(ans, dp[i]);
	}
	cout<<ans<<endl;
}
 
signed main() {

   	fastio

    	int t;cin>>t;while(t--)
	    solve();
 
 
return 0;
}