#include <iostream>
#include <queue>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
const int N = 1e6 + 10;

LL l[N], r[N];
LL c[N], a[N], b[N];
int main()
{
	int T;cin >> T;
	while (T--)
	{
		int n;
		cin >> n;
		for (int i = 1; i <= n; i++)scanf("%lld",&c[i]);
		for (int i = 1; i <= n; i++)scanf("%lld", &a[i]);
		for (int i = 1; i <= n; i++)scanf("%lld", &b[i]);

		LL res = 0;
		for (int i = 1; i < n;i++)
		{
			LL t = abs(a[i+1] - b[i+1]);
			LL t2 = abs(a[i + 1] - b[i + 1]);
			
			l[i] =t+1;
			if (a[i+1] != b[i+1]&&i>1)
				l[i] = max(l[i], l[i - 1] + c[i] - t + 1);
			res = max(res, l[i] + c[i + 1]);
			
		}

		cout << res << endl;
	}
}