#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, ans = -1;
int a[N], w[N];
int per[N], vis[N], idx;

void dfs(int cur)
{
    if (cur > n)
    {
        // for (int i = 2; i <= n; i ++)
        //     for (int j = 1; j < i; j ++) if (per[j] != a[per[i]]) return;

        int res = 0;
        for (int i = 1; i <= n; i ++) res += i * w[per[i]];
        ans = max(ans, res);
        // if (res == 32) for (int i = 1; i <= n; i ++) cout << per[i] << ' ';
        // cout << "\n";
        return;
    }
    for (int i = 1; i <= n; i ++)
    {
        if (vis[i]) continue;
        if (cur == 1 || (!vis[i] && vis[a[i]]))
        {
            per[++ idx] = i, vis[i] = true;
            dfs(cur + 1);
            idx --, vis[i] = false;
        }
    }
}

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    for (int i = 1; i <= n; i ++) read(w[i]);
    dfs(1);

    cout << ans << '\n';
    return 0;
}