#include <bits/stdc++.h>
#define present(container, element) (container.find(element) != container.end()
#define all(c) c.begin(), c.end()
#define lli long long int
#define vi vector<int>
#define cpresent(container, element) (find(all(container),element) != container.end())
#define tr(container, it) for(auto it = container.begin(); it != container.end(); it++)
using namespace std;
int main()
{
int t;

cin>>t;
while(t--)
{
    int n;
    cin>>n;
    vector<lli> 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];
    }
    lli dp[n];
    dp[0]=0;
    lli ans=0;
    for(int i=1;i<n;i++)
    {
        if(b[i]==a[i])
        {
             dp[i]=2+c[i]-1;
             
        }
        else
        {
            lli diff = abs(b[i]-a[i]);
            dp[i]=c[i]-1+2+max(diff, dp[i-1]-diff);

        }
        ans=max(ans, dp[i]);

    }
    cout<<ans<<endl;


}
return 0;
}
