//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
  int n;
  cin>>n;
  vector<int>A(n),B(n),C(n);
   for(int i=0;i<n;i++)cin>>A[i];
   for(int i=0;i<n;i++)cin>>B[i];
   for(int i=0;i<n;i++)cin>>C[i];

  vector<int> D(n);


    int lastSelected = -1;

    for (int i = 0; i < n; ++i) {



        if (lastSelected == 0) {
            if (B[i] > C[i]) {
                lastSelected = 1;
                D[i]=B[i];
            } else {
                lastSelected = 2;
                D[i]=C[i];
            }
        }

        else if (lastSelected == 1) {
            if (A[i] >C[i]) {
                lastSelected = 0;
                D[i]=A[i];
            } else {
                D[i]=C[i];
                lastSelected = 2;
            }
        }

        else if (lastSelected == 2) {
            if (A[i] >B[i]) {
                lastSelected = 0;
                D[i]=A[i];
            } else {
                lastSelected = 1;
                D[i]=B[i];
            }
        }

        else {
            if (A[i] >B[i] && A[i]>C[i]) {
                lastSelected = 0;
                D[i]=A[i];
            } else if (B[i] >B[i] && B[i]>C[i]) {
                lastSelected = 1;
                D[i]=B[i];
            } else {
                D[i]=C[i];
                lastSelected = 2;
            }
        }


    }

    int sum = 0;
    for (int num : D) {
        sum += num;
    }
    cout<<sum<<endl;
}
int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}