#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fod(i,a,b) for(i=a;i>=b;i--)
#define rep(i,a) for(i=first[a];i;i=nxt[i])
#define rep1(i,a) for(i=first1[a];i;i=nxt1[i])
#define rep2(i,a) for(i=first2[a];i;i=nxt2[i])
#define rep3(i,a) for(i=first3[a];i;i=nxt3[i])
using namespace std;
const int maxn=300007;
int i,j,k,l,t,n,m,ans[maxn],o,b;
int first[maxn*20],last[maxn*2],nxt[maxn*2],num;
int first1[maxn*20],last1[maxn*2],nxt1[maxn*2],num1;
int first2[maxn*20],last2[maxn*2],nxt2[maxn*2],num2;
int first3[maxn*20],last3[maxn*2],nxt3[maxn*2],num3;
int a[maxn],deep[maxn],f[maxn][21];
int ci[maxn]; 
int shang[maxn*2],xia[maxn*2]; 
void add(int x,int y){last[++num]=y,nxt[num]=first[x],first[x]=num;}
void add1(int x,int y){last1[++num1]=y,nxt1[num1]=first1[x],first1[x]=num1;}
void add2(int x,int y){last2[++num2]=y,nxt2[num2]=first2[x],first2[x]=num2;}
void add3(int x,int y){last3[++num3]=y,nxt3[num3]=first3[x],first3[x]=num3;}
void dfs(int x,int y){
    int i;
    deep[x]=deep[y]+1,f[x][0]=y;
    rep(i,x)if(last[i]!=y)dfs(last[i],x);
}
int lca(int x,int y){
    int i;if(deep[x]<deep[y])swap(x,y);
    fod(i,20,0)if(deep[f[x][i]]>deep[y])x=f[x][i];
    if(deep[x]!=deep[y])x=f[x][0];
    fod(i,20,0)if(f[x][i]!=f[y][i])x=f[x][i],y=f[y][i];
    return(x!=y)?f[x][0]:x;
}
void dfs1(int x,int y){
   int u=xia[deep[x]+a[x]],v=shang[deep[x]-a[x]+maxn],i;
   xia[deep[x]]+=ci[x];
   rep1(i,x)shang[last1[i]+maxn]++;
   rep(i,x)if(last[i]!=y)dfs1(last[i],x);
   ans[x]=xia[deep[x]+a[x]]+shang[deep[x]-a[x]+maxn]-u-v;
   rep2(i,x){xia[last2[i]]--;if(last2[i]==deep[x]+a[x])ans[x]--;}
   rep3(i,x)shang[last3[i]+maxn]--;
}
int main(){
    //freopen("running.in","r",stdin);
    //freopen("running.out","w",stdout);
    scanf("%d%d",&n,&m);
    fo(i,1,n-1){
       scanf("%d%d",&k,&l);
       add(k,l),add(l,k);
    }   
    dfs(1,0);
    fo(j,1,20)fo(i,1,n)f[i][j]=f[f[i][j-1]][j-1];
    fo(i,1,n)scanf("%d",&a[i]);
    fo(i,1,m){
        scanf("%d%d",&k,&l);
        o=lca(k,l);t=deep[k]+deep[l]-2*deep[o];
        ci[k]++;b=deep[l]-t;
        add1(l,b);add2(o,deep[k]);add3(o,b);
    }
    dfs1(1,0);
    fo(i,1,n)printf("%d ",ans[i]);
}

/**************************************************************
	Problem: 2348
	User: admin
	Language: C++
	Result: Accepted
	Time:5212 ms
	Memory:157816 kb
****************************************************************/