func_code_string: #include <bits/stdc++.h>   using namespace std;      #define ll long long   #define mod 1000000007   #define ffor(i,a,b) for(int i=a;i<b;i++)   #define bfor(i,a,b) for(int i=a-1;i>=b;i--)   #define mp make_pair   #define pb push_back   #define ff first   #define ss second   #define mem(x,y) memset(x,y,sizeof(x))   #define all(x) x.begin(),x.end()   #define SP(x) setprecision(x)   #define sz(x) (int)x.size()   #define fast  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)   #define PI 3.14159265358979323846   #define lb lower_bound   #define ub upper_bound   #define bs binary_search   #define endl   n    #define int long long      void solve()   {       int n;       cin>>n;       int c[n];       int a[n], b[n];          ffor(i,0,n) cin>>c[i];       ffor(i,0,n) cin>>a[i];       ffor(i,0,n) cin>>b[i];          int ans=0;       int dp[n];       mem(dp,0);       dp[1]=abs(a[1]-b[1])+c[1]-1+2;          ffor(i,2,n)       {           if(a[i]==b[i]) dp[i]=c[i]-1+2;           else           {               int x=abs(a[i]-b[i])+c[i]-1+2;               int y=c[i]-1+2+dp[i-1]-abs(a[i]-b[i]);               dp[i]=max(x,y);           }       }       cout<< *max_element(dp,dp+n)<<endl;      }      signed main()   {           #ifndef ONLINE_JUDGE       freopen( input.txt ,  r , stdin);       freopen( output.txt ,  w , stdout);       #endif                   int t;       cin>>t;       while(t--)       {           solve();       }          return 0;   }      