#include<cstdio>

 #include<algorithm>

 #define N 200010

 #define rg register

 using namespace std;

 int n,tot,dfn[N],size[N],p[N],t[N],last[N];

 struct edge{

     int to,pre;

 }e[N];

 inline int read(){

     int k=,f=; char c=getchar();

     while(c<''||c>'')c=='-'&&(f=-),c=getchar();

     while(''<=c&&c<='')k=k*+c-'',c=getchar();

     return k*f;

 }

 inline void add(int x,int y){for(;x<=n;x+=x&-x) t[x]+=y;}

 inline int query(int x){

     int ret=; for(;x;x-=x&-x) ret+=t[x]; return ret;

 }

 void dfs(int x){

     dfn[x]=++tot; size[x]=;

     for(rg int i=last[x],to;i;i=e[i].pre)

         if(!dfn[to=e[i].to]) dfs(to),size[x]+=size[to];

 }

 int main(){

     n=read();

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

         int u=read(),v=read();

         e[++tot]=(edge){v,last[u]}; last[u]=tot;

         e[++tot]=(edge){u,last[v]}; last[v]=tot;

     }

     tot=; dfs();

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

         int x=read();

         printf("%d\n",query(dfn[x]));

         add(dfn[x],); add(dfn[x]+size[x],-);

     }

     return ;

 }