#include <bits/stdc++.h>
using namespace std;

#define int64_t long long

long long place_police(vector<int> P, vector<long long> C, vector<long long> W) {
        int n = P.size() + 1;
        vector<int> deg(n);
        vector<vector<int>> adj(n);
        for (int i = 0; i < n - 1; i++) {
                deg[i + 1]++;
                deg[P[i]]++;
                adj[P[i]].emplace_back(i + 1);
        }
        vector<int64_t> w(n);
        int j = 0;
        for (int i = 0; i < n; i++) {
                if (deg[i] == 1) w[i] = W[j++];
        }
        const int64_t inf = 3e18;
        vector<vector<int64_t>> f(8, vector<int64_t>(n, inf));
        for (int i = n - 1; i >= 0; i--) {
                if (deg[i] == 1) {
                        f[0][i] = f[7][i] = 0;
                } else {
                        for (int j = 0; j < 2; j++) {
                                for (int v : adj[i]) {
                                        if (v == adj[i][0]) {
                                                for (int k = 0; k < 8; k++) {
                                                        int64_t cost = (k >> 2) == j ? C[v - 1] : 0;
                                                        f[(j << 2) | (k & 3)][i] = min(f[(j << 2) | (k & 3)][i], f[k][v] + cost);
                                                }
                                        } else {
                                                vector<int64_t> nf(4, inf);
                                                for (int k = 0; k < 4; k++) {
                                                        for (int p = 0; p < 8; p++) {
                                                                int64_t cost = ((p >> 2) == j) ? C[v - 1] : 0;
                                                                if ((k & 1) == (p >> 1 & 1)) cost += w[v];
                                                                nf[(k & 2) | (p & 1)] = min(nf[(k & 2) | (p & 1)], f[(j << 2) | k][i] + f[p][v] + cost);
                                                        }
                                                }
                                                for (int k = 0; k < 4; k++) {
                                                        f[(j << 2) | k][i] = nf[k];
                                                }
                                        }
                                }
                        }
                }
        }
        int64_t res = inf;
        for (int i = 0; i < 8; i++) {
                res = min(res, f[i][0] + ((i >> 1 & 1) == (i & 1) ? W.back() : 0));
        }
        return res;
}

// int32_t main() {
//         ios_base::sync_with_stdio(0);
//         cin.tie(0);

//         int n, k;
//         cin >> n >> k;
//         vector<int> p(n - 1);
//         vector<int64_t> c(n - 1), w(k);
//         for (int i = 0; i < n - 1; i++) cin >> p[i];
//         for (int i = 0; i < n - 1; i++) cin >> c[i];
//         for (int i = 0; i < k; i++) cin >> w[i];
//         cout << place_police(p, c, w);
// }