#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 301
using namespace std;
const long long inf=(long long)(1e18);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
bool cmp(int x,int y)
{
	return x>y;
}
int n,q,s,cnt,opt,fa[N+1],ls[N+1],rs[N+1],r[N+1],p[N+1],tong[N+1],length,tong2[N+1],length2,dfn[N+1],sz[N+1],leng;
long long w[N+1][N+1],w2[N+1][N+1],dp[2][N+1][N+1][N+1],DP[N+1],ans=-inf;
void dfs(int x)
{
	dfn[x]=++leng;
	if (ls[x]) dfs(ls[x]);
	if (rs[x]) dfs(rs[x]);
	sz[x]=sz[ls[x]]+sz[rs[x]]+1;
	return;
}
void dfs2(int x)
{
	if (ls[x]) dfs2(ls[x]);
	if (rs[x]) dfs2(rs[x]);
	if (ls[x])
	{
		for (int i=0;i<=sz[ls[x]];++i) DP[i]=-inf;
		for (int i=0;i<=sz[ls[ls[x]]];++i)
			for (int j=0;j<=sz[rs[ls[x]]];++j)
				DP[i+j]=max(DP[i+j],max(dp[opt^1][ls[x]][i][j],dp[opt][ls[x]][i][j]));
		for (int i=0;i<=sz[ls[x]];++i)
			for (int j=0;j<=sz[rs[x]];++j)
				dp[opt][x][i][j]=max(dp[opt][x][i][j],DP[i]);
	}
	if (rs[x])
	{
		for (int i=0;i<=sz[rs[x]];++i) DP[i]=-inf;
		for (int i=0;i<=sz[ls[rs[x]]];++i)
			for (int j=0;j<=sz[rs[rs[x]]];++j)
				DP[i+j]=max(DP[i+j],max(dp[opt^1][rs[x]][i][j],dp[opt][rs[x]][i][j]));
		for (int i=0;i<=sz[ls[x]];++i)
			for (int j=0;j<=sz[rs[x]];++j)
				dp[opt][x][i][j]=max(dp[opt][x][i][j],DP[j]);
	}
	return;
}
void dfs3(int x)
{
	if (ls[x])
	{
		for (int i=0;i<=sz[ls[x]];++i) DP[i]=-inf;
		for (int i=0;i<=sz[ls[x]];++i)
			for (int j=0;j<=sz[rs[x]];++j)
				DP[i]=max(DP[i],max(dp[opt^1][x][i][j],dp[opt][x][i][j]));
		for (int i=0;i<=sz[ls[ls[x]]];++i)
			for (int j=0;j<=sz[rs[ls[x]]];++j)
				dp[opt][ls[x]][i][j]=max(dp[opt][ls[x]][i][j],DP[i+j]);
	}
	if (rs[x])
	{
		for (int i=0;i<=sz[rs[x]];++i) DP[i]=-inf;
		for (int i=0;i<=sz[ls[x]];++i)
			for (int j=0;j<=sz[rs[x]];++j)
				DP[j]=max(DP[j],max(dp[opt^1][x][i][j],dp[opt][x][i][j]));
		for (int i=0;i<=sz[ls[rs[x]]];++i)
			for (int j=0;j<=sz[rs[rs[x]]];++j)
				dp[opt][rs[x]][i][j]=max(dp[opt][rs[x]][i][j],DP[i+j]);
	}
	if (ls[x]) dfs3(ls[x]);
	if (rs[x]) dfs3(rs[x]);
	return;
}
bool LENG(int x,int y)
{
	return dfn[x]<=dfn[y]&&dfn[y]<=dfn[x]+sz[x]-1;
}
int main()
{
	int op;
	n=read(),q=read(),s=read();
	for (int i=2;i<=n;++i)
	{
		fa[i]=read();
		if (!ls[fa[i]]) ls[fa[i]]=i;
		else rs[fa[i]]=i;
	}
	for (int i=2;i<=n;++i) r[i]=read();
	for (int i=2;i<=n;++i) p[i]=read();
	dfs(1);
	for (int i=1;i<=n;++i)
	{
		length=length2=0;
		for (int j=1;j<=n;++j)
		{
			if (LENG(i,j)) tong[++length]=p[j];
			else tong2[++length2]=p[j];
		}
		sort(tong+1,tong+length+1,cmp),sort(tong2+1,tong2+length2+1,cmp);
		for (int j=1;j<=length;++j) w[i][j]=w[i][j-1]+tong[j];
		for (int j=1;j<=length2;++j) w2[i][j]=w2[i][j-1]+tong2[j];
	}
	for (int i=1;i<=n;++i)
		for (int j=0;j<=sz[ls[i]];++j)
			for (int k=0;k<=sz[rs[i]];++k)
				dp[0][i][j][k]=-inf;
	dp[0][s][0][0]=0;
	for (int i=1;i<=q;++i)
	{
		opt^=1;
		for (int j=1;j<=n;++j)
			for (int k=0;k<=sz[ls[j]];++k)
				for (int t=0;t<=sz[rs[j]];++t)
					dp[opt][j][k][t]=-inf;
		op=read();
		if (op==1) dfs2(1);
		else if (op==2) dfs3(1);
		else if (op==3)
		{
			for (int j=1;j<=n;++j)
				for (int k=0;k<=sz[ls[j]];++k)
					for (int t=0;t<=sz[rs[j]];++t)
						dp[opt][j][k][t]=dp[opt^1][j][k][t];
			cnt++;
		}
		else
		{
			cnt--;
			for (int j=1;j<=n;++j)
				for (int k=0;k<=sz[ls[j]];++k)
					for (int t=0;t<=sz[rs[j]];++t)
						dp[opt][j][k][t]=dp[opt^1][j][k][t];
			if (cnt<0)
			{
				puts("No solution.");
				return 0;
			}
		}
		for (int j=1;j<=n;++j)
			for (int k=0;k<=sz[ls[j]];++k)
				for (int t=0;t<=sz[rs[j]];++t)
					if (dp[opt][j][k][t]>=0)
					{
						if (cnt-k-t<0||cnt-k-t>n-sz[j]) dp[opt][j][k][t]=-inf;
						else dp[opt][j][k][t]+=r[j]+w[ls[j]][k]+w[rs[j]][t]+w2[j][cnt-k-t];
					}
	}
	for (int i=1;i<=n;++i)
		for (int j=0;j<=sz[ls[i]];++j)
			for (int k=0;k<=sz[rs[i]];++k)
				ans=max(ans,dp[opt][i][j][k]);
	if (ans<0) puts("No solution.");
	else printf("%lld\n",ans);
	return 0;
}