#include <bits/stdc++.h>
using namespace std;
template <class T>
void DBGpair(T a, string s = "") {
  return;
}
template <class T>
void DBGvec(vector<T> &a) {}
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
char dir[] = {'R', 'L', 'D', 'U'};
const int MOD = 1e9 + 7;
const long long INF = 1e9;
void setIO(string filename) {
  if (fopen((filename + ".in").c_str(), "r")) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
  }
}
void solve() {
  int n;
  cin >> n;
  vector<long long> s(n), tag(n), dp(n);
  for (auto &i : s) cin >> i;
  for (auto &i : tag) cin >> i;
  for (int j = 1; j < n; j++) {
    for (int i = j - 1; i >= 0; i--) {
      if (tag[i] == tag[j]) continue;
      long long dpi = dp[i], dpj = dp[j], dif = abs(s[i] - s[j]);
      dp[i] = max(dp[i], dpj + dif);
      dp[j] = max(dp[j], dpi + dif);
    }
  }
  cout << *max_element((dp).begin(), (dp).end()) << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) solve();
  return 0;
}
