/* c.cpp */
#include <bits/stdc++.h>

using i64 = long long;
constexpr i64 inf = 1e18;

void solve() {
    int n, m, R, P;
    std::cin >> n >> m >> R >> P;

    std::vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
        --a[i];
    }

    std::vector<int> v(m);
    for (int i = 0; i < m; ++i) {
        std::cin >> v[i];
    }

    if (P <= 2) {
        i64 ans = 0;
        for (auto x : a) {
            ans += v[x];
        }
        std::cout << ans << '\n';
        return;
    }

    std::vector s(m, std::vector<i64>(n + 1));
    for (int i = 0; i < m; ++i) {
        s[i][1] = v[i];
        for (int j = 2; j <= n; j *= 2) {
            s[i][j] = s[i][j / 2] * P;
        }
        for (int j = 2; j <= n; ++j) {
            s[i][j] = s[i][j & -j] + s[i][j & (j - 1)];
        }
    }

    std::vector f(n + 1, std::vector(n + 1, 0ll));
    for (int i = 0; i < n; ++i) {
        f[i][i + 1] = v[a[i]];
    }

    for (int len = 2; len <= n; ++len) {
        for (int l = 0; l + len <= n; ++l) {
            int r = l + len;
            for (int i = l + 1; i < r; ++i) {
                f[l][r] = std::max(f[l][r], f[l][i] + f[i][r]);
            }

            int lst = l, cnt = 1;
            i64 sum = 0;
            for (int i = l + 1; i < r; ++i) {
                if (a[i] == a[l]) {
                    sum += f[lst + 1][i];
                    lst = i;
                    cnt += 1;
                }
            }
            sum += f[lst + 1][r];
            f[l][r] = std::max(f[l][r], sum + s[a[l]][cnt]);
        }
    }

    std::cout << f[0][n] << '\n';
}

int main() {
    std::cin.tie(nullptr)->sync_with_stdio(false);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}