# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iostream>
# include <vector>
# include <queue>
# include <stack>
# include <map>
# include <bitset>
# include <set>
# include <cmath>
# include <algorithm>
using namespace std;
# define lowbit(x) ((x)&(-x))
# define pi acos(-1.0)
# define eps 1e-8
# define MOD 2007
# define INF 1000000000
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
# define lch p<<1,l,mid
# define rch p<<1|1,mid+1,r
# define mp make_pair
# define pb push_back
typedef pair<int,int> PII;
typedef vector<int> VI;
# pragma comment(linker, "/STACK:1024000000,1024000000")
typedef long long LL;
int Scan() {
    int x=0,f=1;char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
const int N=105;
//Code begin...

struct Edge{int p, next;}edge[N];
int head[N], cnt=1;
int W[N], V[N], D[N], cost[N], val[N], dp[N][505], m;
int Low[N], DFN[N], Stack[N], Belong[N], dee[N], Index, top, scc;
bool Instack[N], vis[N][N];
VI E[N];

void add_edge(int u, int v){edge[cnt].p=v; edge[cnt].next=head[u]; head[u]=cnt++;}
void Tarjan(int u){
    int v;
    Low[u]=DFN[u]=++Index; Stack[top++]=u; Instack[u]=true;
    for (int i=head[u]; i; i=edge[i].next) {
        v=edge[i].p;
        if (!DFN[v]) {
            Tarjan(v);
            if (Low[u]>Low[v]) Low[u]=Low[v];
        }
        else if (Instack[v]&&Low[u]>DFN[v]) Low[u]=DFN[v];
    }
    if (Low[u]==DFN[u]) {
        ++scc;
        do{
            v=Stack[--top]; Instack[v]=false; Belong[v]=scc; cost[scc]+=W[v]; val[scc]+=V[v];
        }while (v!=u);
    }
}
void solve(int n){
    mem(DFN,0); mem(Instack,false); Index=scc=top=0;
    FOR(i,1,n) if (!DFN[i]) Tarjan(i);
}
void dfs(int x){
    FO(i,0,E[x].size()) {
        int v=E[x][i];
        dfs(v);
        for (int j=m; j>=0; --j) FOR(k,cost[v],j) dp[x][j]=max(dp[x][j],dp[x][j-k]+dp[v][k]);
    }
    for (int i=m; i>=cost[x]; --i) dp[x][i]=dp[x][i-cost[x]]+val[x];
}
int main ()
{
    int n;
    scanf("%d%d",&n,&m);
    FOR(i,1,n) scanf("%d",W+i);
    FOR(i,1,n) scanf("%d",V+i);
    FOR(i,1,n) {
        scanf("%d",D+i);
        if (D[i]) add_edge(D[i],i);
    }
    solve(n);
    FOR(i,1,n) {
        int u=Belong[i];
        for (int j=head[i]; j; j=edge[j].next) {
            int v=Belong[edge[j].p];
            if (u==v||vis[u][v]) continue;
            E[u].pb(v); vis[u][v]=true; ++dee[v];
        }
    }
    FOR(i,1,scc) if (!dee[i]) E[0].pb(i);
    dfs(0);
    printf("%d\n",dp[0][m]);
    return 0;
}