/*
*Code by Ahmed Wasfey created : 2021-01-29
*/
#include <bits/stdc++.h>
using namespace std;
#define loop(v, st, en) for (int v = st; v < en; v++)
#define loopdesc(v, st, en) for (int v = st; v >= en; v--)
#define clr(v, d) memset(v, d, sizeof(v))
#define P(x) cout << #x << " = { " << x << " }\n"
#define PI acos(-1)

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
const int N = 1e5 + 5, OO = 0x3f3f3f3f, mod = 1e9 + 7;

void CLEAR() {}
void solveTC()
{
    int n;
    cin >> n;
    ll a[N], b[N], c[N], ans = 0, bsta = -1;
    loop(i, 0, n) cin >> c[i];
    loop(i, 0, n) cin >> a[i];
    loop(i, 0, n) cin >> b[i];
    loop(i, 0, n)
    {
        if (a[i] > b[i])
            swap(a[i], b[i]);
    }
    ans = bsta = c[n - 1] - 1;
    for (int i = n - 1; i > 0; i--)
    {
        ans += 2;
        bsta = max(ans, bsta);
        if (a[i] != b[i])
        {
            ll x = (a[i] - 1 + c[i - 1] - b[i]);
            if (i != 1)
                bsta = max(ans + x, bsta);
            bsta = max(ans + c[i - 1] - x - 1, bsta);
            ans += x;
        }
        else
        {
            ans = c[i - 1] - 1;
        }
        ans = max(ans, c[i - 1] - 1);
        if(i != 1)bsta = max(ans, bsta);
    }
    cout << bsta << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tc;
    cin >> tc;
    while (tc--)
    {
        CLEAR();
        solveTC();
    }

    return 0;
}