#ifdef DEBUG
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int n, m, R, p;
const int maxN = 105;
int a[maxN];
int V[maxN];
ll dp[maxN][maxN];
int lg[maxN];
ll f[maxN][maxN][maxN];
int cnt[maxN];
void solve() {
    cin >> n >> m >> R >> p;
    for (int i = 1; i <= m; i++) cnt[i] = 0;
    lg[1] = 1;
    for (int i = 2; i <= n; i++) {
        lg[i] = -1;
        if (i % 2 == 0 && lg[i / 2] != -1) {
            lg[i] = lg[i / 2] + 1;
        }
    }
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cnt[a[i]]++;
    }
    for (int i = 1; i <= m; i++) {
        cin >> V[i];
    }
    for (int l = n; l >= 1; l--) {
        for (int r = l; r <= n; r++) {
            dp[l][r] = -1e18;
            for (int k = 1; k <= cnt[a[r]]; k++) {
                f[l][r][k] = -1e18;
            }
            if (l == r) {
                dp[l][r] = V[a[l]];
                f[l][r][1] = 0;
                continue;
            }
            f[l][r][1] = 0;
            for (int prv = l; prv < r; prv++) {
                if (a[prv] == a[r]) {
                    for (int z = 1; z < cnt[a[r]]; z++) {
                        f[l][r][z + 1] = max(f[l][r][z + 1], f[l][prv][z] + dp[prv + 1][r - 1]);
                    }
                }
            }
            for (int k = l; k < r; k++) {
                dp[l][r] = max(dp[l][r], dp[l][k] + dp[k + 1][r]);
            }
            for (int k = l; k <= r; k++) {
                ll coef = V[a[k]];
                for (int D = 1; D <= (1 << (R - 1)) && D <= cnt[a[k]]; D *= 2) {
                    dp[l][r] = max(dp[l][r], f[l][k][D] + coef + dp[k + 1][r]);
                    coef *= p;
                }
            }
        }
    }
    cout << dp[1][n] << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef DEBUG
    freopen("input.txt", "r", stdin);
#endif
    int tst;
    cin >> tst;
    while (tst--) {
        solve();
    }
    return 0;
}