#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<cstdio>
#include<cctype>
#include<vector>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef unsigned long long ll;
const int M=12;
const int N=705;
const int B=6662333;
const int INF=1e9;
inline int read(){int X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();return w?-X:X;
}
int dis[M][M],wx[M],wy[M],match[M],sla[M];
bool vx[M],vy[M];
bool dfs2(int u,int n){vx[u]=1;for(int v=1;v<=n;v++){       if(!vy[v]){int w=wx[u]+wy[v]-dis[u][v];if(!w){vy[v]=1;if(!match[v]||dfs2(match[v],n)){match[v]=u;return 1;}}else sla[v]=min(sla[v],w);}}return 0;
}
int KM(int n){memset(wx,-127,sizeof(wx));memset(wy,-127,sizeof(wy));memset(match,0,sizeof(match));for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)wx[i]=max(wx[i],dis[i][j]);for(int i=1;i<=n;i++){memset(sla,127,sizeof(sla));while(1){memset(vx,0,sizeof(vx));memset(vy,0,sizeof(vy));if(dfs2(i,n))break;int minn=INF;for(int j=1;j<=n;j++)if(!vy[j])minn=min(minn,sla[j]);for(int j=1;j<=n;j++){if(vx[j])wx[j]-=minn;if(vy[j])wy[j]+=minn;else sla[j]-=minn;}}}int ans=0;for(int i=1;i<=n;i++)if(dis[match[i]][i]!=-INF)ans-=dis[match[i]][i];return ans;
}
struct node{int to,nxt;
}e[N*2];
int n,cnt,head[N],fa[N],a[N],b[N],q[N],size[N],son[N],dep[N];
ll h[N];
inline void add(int u,int v){e[++cnt].to=v;e[cnt].nxt=head[u];head[u]=cnt;
}
int calcg(int st){int r=0,g1,g2=0,maxn=n;q[++r]=st;fa[st]=0;for(int l=1;l<=r;l++){int u=q[l];size[u]=1;son[u]=0;for(int i=head[u];i!=-1;i=e[i].nxt){int v=e[i].to;if(v==fa[u])continue;fa[v]=u;q[++r]=v;}}for(int l=r;l>=1;l--){int u=q[l],v=fa[u];if(r-size[u]>son[u])son[u]=r-size[u];if(son[u]<maxn)g1=u,maxn=son[u],g2=0;else if(son[u]==maxn)g2=u;if(!v)break;size[v]+=size[u];if(size[u]>son[v])son[v]=size[u];}if(!g2)return g1;for(int i=head[g1];i!=-1;i=e[i].nxt){int v=e[i].to;if(v==g2){e[i].to=++n;e[i^1].to=n;add(n,g1);add(n,g2);return n;}}
}
ll dfs1(int u){ll num[N];int r=0;size[u]=1;h[u]=B;for(int i=head[u];i!=-1;i=e[i].nxt){int v=e[i].to;if(v==fa[u])continue;fa[v]=u;dep[v]=dep[u]+1;num[++r]=dfs1(v);size[u]+=size[v];}sort(num+1,num+r+1);for(int i=1;i<=r;i++)h[u]=h[u]*B+num[i];return h[u]*=size[u];
}
int f[N][N],to1[N],to2[N];
int find(int u1,int u2){int idx1=0,idx2=0;memset(to1,0,sizeof(to1));memset(to2,0,sizeof(to2));for(int i=head[u1];i!=-1;i=e[i].nxt){int v1=e[i].to;if(v1==fa[u1])continue;if(!to1[v1])to1[v1]=++idx1;for(int j=head[u2];j!=-1;j=e[j].nxt){int v2=e[j].to;if(v2==fa[u2])continue;if(!to2[v2])to2[v2]=++idx2;//printf("1 %d %d %d\n",v1,v2,f[v1][v2]);dis[to1[v1]][to2[v2]]=-f[v1][v2];}}return KM(idx1)+(a[u1]!=b[u2]);
}
int bfs(int s){int r=0;q[++r]=s;for(int l=0;l<=r;l++){int u=q[l];for(int i=head[u];i!=-1;i=e[i].nxt){int v=e[i].to;if(v==fa[u])continue;q[++r]=v;}}for(int i=r;i>=0;i--){if(dep[q[i]]!=dep[q[r]]){i++;for(int j=r;j>=i;j--)for(int k=r;k>=i;k--)if(h[q[j]]==h[q[k]]){f[q[j]][q[k]]=find(q[j],q[k]);//printf("%d %d %d\n",q[j],q[k],f[q[j]][q[k]]);
            }r=i-1;}}return find(s,s);
}
int main(){cnt=-1,memset(head,-1,sizeof(head));n=read();for(int i=1;i<n;i++){int u=read(),v=read();add(u,v);add(v,u);}for(int i=1;i<=n;i++)a[i]=read();for(int i=1;i<=n;i++)b[i]=read();int rt=calcg(1);fa[rt]=0;dfs1(rt);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)f[i][j]=INF;printf("%d\n",bfs(rt));return 0;
}