#include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...) 417
#endif
using i64 = int64_t;
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  cout << fixed << setprecision(20);
  int n, k, w;
  cin >> n >> k >> w;
  vector<int> m(n), c(n);
  for (int& ci : c) { cin >> ci; }
  for (int& mi : m) { cin >> mi; }
  vector<int> p(2 * k - 1);
  for (int i = k; i <= 2 * k - 2; i += 1) { cin >> p[i]; }
  vector f(n, vector<i64>(n, -1e18));
  vector g(n, vector<i64>(n, -1e18));
  vector h(n, vector<i64>(2 * k - 1));
  for (int j = 0; j < n; j += 1) {
    for (int i = j; i >= 0; i -= 1) {
      if (i == j) {
        f[i][j] = g[i][j] = p[k] - (k - m[i]) * w;
        continue;
      }
      for (int k = i; k < j; k += 1) {
        f[i][j] = max(f[i][j],
                      max(f[i][k], g[i][k]) + max(f[k + 1][j], g[k + 1][j]));
      }
      if (c[i] == c[j]) {
        ranges::fill(h[i], -(i64)1e18);
        h[i][m[i]] = 0;
        for (int x = i + 1; x <= j; x += 1) {
          ranges::fill(h[x], -(i64)1e18);
          if (c[x] == c[i]) {
            for (int y = i; y < x; y += 1) {
              if (c[y] == c[i]) {
                i64 wt = -1e18;
                if (y + 1 == x) {
                  wt = 0;
                } else if (y + 2 == x) {
                  wt = p[k] - (k - m[y + 1]) * w;
                } else {
                  wt = max(wt, g[y + 1][x - 1]);
                  for (int k = y + 1; k < x - 1; k += 1) {
                    if ((c[k] != c[i] and c[k + 1] != c[j]) or
                        c[y + 1] != c[x - 1]) {
                      wt =
                          max(wt, max(f[y + 1][k], g[y + 1][k]) +
                                      max(f[k + 1][x - 1], g[k + 1][x - 1]));
                    }
                  }
                }
                for (int z = 1; z < k; z += 1) {
                  h[x][z + m[x]] = max(h[x][z + m[x]], wt + h[y][z]);
                }
              }
            }
          }
        }
        for (int z = 1; z <= 2 * k - 2; z += 1) {
          if (z < k) {
            g[i][j] = max(g[i][j], h[j][z] + p[k] - (k - z) * w);
          } else {
            g[i][j] = max(g[i][j], h[j][z] + p[z]);
          }
        }
      }
      debug(i, j, f[i][j], g[i][j]);
    }
  }
  cout << max(f[0][n - 1], g[0][n - 1]);
}