#include <bits/stdc++.h>

const int N = ;

int head[N], cnt;

struct Node {int u, v, nxt;};

int Tim, Bel[N], Low[N], Dfn[N], Stack[N], topp;

int W[N], V[N], Tw[N], Tv[N];

Node G[N];

int n, M;

bool vis[N];

int Gra;

inline void Add(int u, int v) {G[++ cnt].v = v; G[cnt].nxt = head[u]; head[u] = cnt;}

void Tarjan(int u) {

    Dfn[u] = Low[u] = ++ Tim;

    Stack[++ topp] = u, vis[u] = ;

    for(int i = head[u]; ~ i; i = G[i].nxt) {

        int v = G[i].v;

        if(!Dfn[v]) {

            Tarjan(v);

            Low[u] = std:: min(Low[u], Low[v]);

        } else if(vis[v]) Low[u] = std:: min(Low[u], Low[v]);

    }

    if(Low[u] == Dfn[u]) {

        vis[u] = , Bel[u] = ++ Gra, Tw[Gra] += W[u], Tv[Gra] += V[u];

        while(Stack[topp] != u) {

            vis[Stack[topp]] = , Bel[Stack[topp]] = Gra, Tw[Gra] += W[Stack[topp]], Tv[Gra] += V[Stack[topp]];

            topp --;

        } topp --;

    }

}

int In[N], head_2[N];

Node E[N];

inline void Add2(int u, int v) {E[++ cnt].v = v, E[cnt].nxt = head_2[u], head_2[u] = cnt;}

void Re_build() {

    cnt = ;

    for(int i = ; i <= Gra; i ++) head_2[i] = -;

    for(int u = ; u <= n; u ++)

        for(int i = head[u]; ~ i; i = G[i].nxt) {

            int v = G[i].v;

            if(Bel[u] != Bel[v]) Add2(Bel[u], Bel[v]), In[Bel[v]] = ;

        }

}

int f[N][N * ];

void Dfs(int u) {

    for(int i = head_2[u]; ~ i; i = E[i].nxt) {

        int v = E[i].v;

        Dfs(v);

        for(int j = M - Tw[u]; j >= ; j --)

            for(int k = ; k <= j; k ++)

                f[u][j] = std:: max(f[u][j], f[u][k] + f[v][j - k]);

    }

    for(int j = M; j >= ; j --) {

        if(j >= Tw[u]) f[u][j] = f[u][j - Tw[u]] + Tv[u];

        else f[u][j] = ;

    }

}

#define gc getchar()

inline int read() {

    int x = ; char c = gc;

    while(c < '' || c > '') c = gc;

    while(c >= '' && c <= '') x = x *  + c - '', c = gc;

    return x;

}

int main() {

    n = read(), M = read();

    for(int i = ; i <= n; i ++) head[i] = -;

    for(int i = ; i <= n; i ++) W[i] = read();

    for(int i = ; i <= n; i ++) V[i] = read();

    for(int i = ; i <= n; i ++) {

        int u = read();

        if(u) Add(u, i);

    }

    for(int i = ; i <= n; i ++) if(!Dfn[i]) Tarjan(i);

    Re_build();

    for(int i = ; i <= Gra; i ++) if(!In[i]) Add2(, i);

    Dfs();

    std:: cout << f[][M];

    return ;

}