#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 int dp[][][][],p[],q[];

 int dfs(int a,int b,int c,int d,int sum)

 {

     int maxn=;

     if(a>b&&c>d) return ;

     if(dp[a][b][c][d]) return dp[a][b][c][d];

     if(a<=b){

         maxn=max(maxn,sum-dfs(a+,b,c,d,sum-p[a]));

         maxn=max(maxn,sum-dfs(a,b-,c,d,sum-p[b]));

     }

     if(c<=d){

         maxn=max(maxn,sum-dfs(a,b,c+,d,sum-q[c]));

         maxn=max(maxn,sum-dfs(a,b,c,d-,sum-q[d]));

     }

     dp[a][b][c][d]=maxn;

     return maxn;

 }

 int main()

 {

     int T,n,sum;

     scanf("%d",&T);

     while(T--){

         sum=;

         scanf("%d",&n);

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

             scanf("%d",&p[i]);

             sum+=p[i];

         }

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

             scanf("%d",&q[i]);

             sum+=q[i];

         }

         memset(dp,,sizeof(dp));

         int ans=dfs(,n,,n,sum);

         printf("%d\n",ans);

     }

     return ;

 }