1 #include<bits/stdc++.h>
 2 #define inf 600000
 3 #define lc(x) t[x].l
 4 #define rc(x) t[x].r
 5 using namespace std;
 6 const int N=300005,M=20000005;
 7 struct segt{int l,r,sm;}t[M];
 8 struct node{int y,nxt;}e[N*3];
 9 vector<int>p1[N],p2[N];int h[N],c=1;
10 int n,m,ans[N],q[N],rt[N],d[N],fa[N][20],cnt;
11 void add(int x,int y){
12     e[++c]=(node){y,h[x]};h[x]=c;
13     e[++c]=(node){x,h[y]};h[y]=c;
14 } int dfs(int x,int f){
15     fa[x][0]=f;rt[x]=x;++cnt;
16     for(int i=1;i<=19;i++)
17     fa[x][i]=fa[fa[x][i-1]][i-1];
18     for(int i=h[x],y;i;i=e[i].nxt)
19     if((y=e[i].y)!=f) d[y]=d[x]+1,dfs(y,x);
20 } int lca(int x,int y){
21     if(d[x]<d[y]) swap(x,y);
22     for(int i=19;~i;i--)
23     if(d[fa[x][i]]>=d[y]) x=fa[x][i];
24     if(x==y) return x;
25     for(int i=19;~i;i--){
26         if(fa[x][i]!=fa[y][i])
27         x=fa[x][i],y=fa[y][i];
28     } return fa[x][0];
29 } int pushup(int x){
30     t[x].sm=t[lc(x)].sm+t[rc(x)].sm;
31 } int update(int &x,int l,int r,int p,int v){
32     if(!x) x=++cnt;if(l==r){
33         t[x].sm+=v;return 0;
34     } int mid=l+r>>1;
35     if(p<=mid) update(lc(x),l,mid,p,v);
36     else update(rc(x),mid+1,r,p,v);
37     pushup(x);return 0;
38 } int query(int x,int l,int r,int p){
39     if(l==r) return t[x].sm;int mid=l+r>>1;
40     if(p<=mid) return query(lc(x),l,mid,p);
41     else return query(rc(x),mid+1,r,p);
42 } int merge(int x,int y,int l,int r){
43     if(!x||!y) return x|y;int mid=l+r>>1;
44     if(l==r){
45         t[x].sm+=t[y].sm;return x;
46     } t[x].l=merge(lc(x),lc(y),l,mid);
47     t[x].r=merge(rc(x),rc(y),mid+1,r);
48     pushup(x);return x;
49 } int solve(int x,int f){
50     for(int i=0;i<p1[x].size();i++)
51     update(rt[x],0,inf,p1[x][i],1);
52     for(int i=0;i<p2[x].size();i++)
53     update(rt[x],0,inf,p2[x][i],-1);
54     for(int i=h[x],y;i;i=e[i].nxt)
55     if((y=e[i].y)!=f) solve(y,x),
56     merge(rt[x],rt[y],0,inf);
57     if(d[x]+n-q[x]>=0) ans[x]+=
58     query(rt[x],0,inf,d[x]+n-q[x]);
59     if(d[x]+n+q[x]<=inf&&q[x]) ans[x]+=
60     query(rt[x],0,inf,d[x]+n+q[x]);
61 } int main(){
62     scanf("%d%d",&n,&m);
63     for(int i=1,x,y;i<n;i++)
64     scanf("%d%d",&x,&y),add(x,y);
65     for(int i=1;i<=n;i++)
66     scanf("%d",&q[i]);d[1]=1;dfs(1,0);
67     for(int i=1,x,y;i<=m;i++){
68         scanf("%d%d",&x,&y);int a=lca(x,y);
69         p1[x].push_back(d[x]+n);
70         p1[y].push_back(n+2*d[a]-d[x]);
71         p2[a].push_back(d[x]+n);
72         p2[fa[a][0]].push_back(n+2*d[a]-d[x]);
73     } solve(1,0);for(int i=1;i<=n;i++)
74     printf("%d ",ans[i]);return 0;
75 }