#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

const int maxn =  + ;

int kase, n;

int p[maxn], v[maxn];

int d[maxn][maxn][maxn][];

int vis[maxn][maxn][maxn][];

// already considered s~e, still need to delivery to cnt people.

// pos = 0 means at s, pos = 1 means at e

int dp(int s, int e, int cnt, int pos) {

  if(cnt == ) return ;

  int &ans = d[s][e][cnt][pos];

  if(vis[s][e][cnt][pos] == kase) return ans;

  vis[s][e][cnt][pos] = kase;

  ans = ;

  if(!pos) {

    for(int i = ; i < s; i++)

      ans = max(ans, v[i] - cnt * abs(p[i] - p[s]) + dp(i, e, cnt - , ));

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

      ans = max(ans, v[i] - cnt * abs(p[i] - p[s]) + dp(s, i, cnt - , ));

  }

  else {

    for(int i = ; i < s; i++)

      ans = max(ans, v[i] - cnt * abs(p[i] - p[e]) + dp(i, e, cnt - , ));

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

      ans = max(ans, v[i] - cnt * abs(p[i] - p[e]) + dp(s, i, cnt - , ));

  }

  return ans;

}

int main() {

  int T;

  scanf("%d",&T);

  memset(vis, , sizeof(vis));

  for(kase = ; kase <= T; kase++) {

    scanf("%d", &n);

    for(int i = ; i < n; i++) scanf("%d", &p[i]);

    for(int i = ; i < n; i++) scanf("%d", &v[i]);

    int ans = ;

    for(int k = ; k <= n; k++)

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

        ans = max(ans, v[i] - k * abs(p[i]) + dp(i, i, k - , ));//注意罚时的计算

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

  }

  return ;

}