import std.algorithm;
import std.conv;
import std.range;
import std.stdio;
import std.string;

void main ()
{
	auto tests = readln.strip.to !(int);
	foreach (test; 0..tests)
	{
		auto n = readln.strip.to !(int);
		auto c = readln.splitter.map !(to !(int)).array;
		auto a = readln.splitter.map !(to !(int)).array;
		auto b = readln.splitter.map !(to !(int)).array;
		long res = 0;
		long cur = c[n - 1] - 1;
		foreach_reverse (i; 1..n)
		{
			cur += 2;
			if (a[i] > b[i])
			{
				swap (a[i], b[i]);
			}
			res = max (res, cur + b[i] - a[i]);
			cur = max (cur, b[i] - a[i]);
			cur += c[i - 1] - b[i];
			cur += a[i] - 1;
			if (a[i] == b[i])
			{
				cur = c[i - 1] - 1;
			}
		}
		writeln (res);
	}
}
