1 #include<cstdio>
  2 #include<iostream>
  3 #include<vector>
  4 #define maxn 600005
  5 using namespace std;
  6
  7 struct edge{
  8     int from,v;
  9 }e[maxn];
 10
 11 vector<int> q1[maxn],q2[maxn],q3[maxn];
 12
 13 bool book[maxn];
 14 int n,ans[maxn],m,a,b,s,t;
 15 int tot,first[maxn],depth[maxn],fa[maxn][20],down[maxn],up[maxn],c[maxn],w[maxn];
 16 void insert(int u,int v){
 17     tot++;
 18     e[tot].from = first[u];
 19     e[tot].v = v;
 20     first[u] = tot;
 21 }
 22
 23 void dfs(int now){
 24 //    cout << "A";
 25     for(int i = first[now];i;i = e[i].from){
 26         int v = e[i].v;
 27         if(!depth[v]){
 28             depth[v] = depth[now]+1;
 29             fa[v][0] = now;
 30             for(int i = 1;i <= 18;i++)
 31                 fa[v][i] = fa[fa[v][i-1]][i-1];
 32             dfs(v);
 33         }
 34     }
 35 }
 36
 37 int LCA(int u,int v){
 38     if(depth[u] < depth[v]) swap(u,v);
 39     for(int i = 18;i >= 0;i--)
 40         if(depth[fa[u][i]] >= depth[v])
 41             u = fa[u][i];
 42     if(u == v) return u;
 43     for(int i = 18;i >= 0;i--)
 44         if(fa[u][i] != fa[v][i])
 45             u = fa[u][i],v = fa[v][i];
 46     return fa[u][0];
 47 }
 48
 49 void DFS(int now){
 50 //    cout << "B";
 51     int u = down[depth[now]+w[now]],v = up[depth[now]-w[now]+n];
 52     down[depth[now]] += c[now];
 53
 54     int s1 = q1[now].size();
 55     for(int i = 0;i < s1;i++){
 56         up[q1[now][i]+n]++;
 57     }
 58
 59     for(int i = first[now];i;i = e[i].from){
 60         if(!book[e[i].v]){
 61             book[e[i].v] = true;
 62             DFS(e[i].v);
 63         }
 64     }
 65 //    cout << "C";
 66     ans[now] = up[depth[now]-w[now]+n] + down[depth[now]+w[now]] -u-v; // ?
 67
 68     int s2 = q2[now].size();
 69     for(int i = 0;i < s2;i++){
 70         down[q2[now][i]]--;
 71         if(q2[now][i] == depth[now]+w[now])
 72             ans[now]--;
 73     }
 74 //    cout << "D";
 75     int s3 = q3[now].size();
 76     for(int i = 0;i < s3;i++){
 77         up[q3[now][i]+n]--;
 78     }
 79 //    cout << "E";
 80 }
 81
 82 int main(){
 83     scanf("%d%d",&n,&m);
 84
 85     for(int i = 1;i < n;i++){
 86         scanf("%d%d",&a,&b);
 87         insert(a,b);
 88         insert(b,a);
 89     }
 90
 91     depth[1] = 1;
 92     dfs(1);
 93
 94
 95     for(int i = 1;i <= n;i++){
 96         scanf("%d",&w[i]);
 97     }
 98
 99     for(int i = 1;i <= m;i++){
100         scanf("%d%d",&s,&t);
101         c[s]++;
102         int anc = LCA(s,t);
103         int pathlen = depth[s]+depth[t]-2*depth[anc];
104         q1[t].push_back(depth[t]-pathlen);
105         q2[anc].push_back(depth[s]);
106         q3[anc].push_back(depth[t]-pathlen);
107     }
108
109     book[1] = true;
110     DFS(1);
111
112     for(int i = 1;i <= n;i++){
113         printf("%d ",ans[i]);
114     }
115
116     return 0;
117 }