#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<vector>
#define N 300005
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define ll long long
#define ul unsigned long long
#define int long long
using namespace std;
int n,m,h[N<<1],cnt,w[N],d[N],f[N][20],bs[N],bt[N*3],ans[N],x,y,z;const int eps=6e5;
struct edge{int v,n;}e[N<<1];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
vector<int>s[N],t[N],l[N];
void dfs1(int u,int fa)
{
	d[u]=d[fa]+1;f[u][0]=fa;
	for(int i=h[u];i;i=e[i].n)
	{
		int v=e[i].v;
		if(v==fa)continue;
		dfs1(v,u);
	}
}
void init()
{
	fo(k,1,19)
		fo(i,1,n)
			f[i][k]=f[f[i][k-1]][k-1];
}
int lca(int x,int y)
{
	if(d[x]<d[y])swap(x,y);
	for(int i=19;~i;i--)
		if(d[f[x][i]]>=d[y])
			x=f[x][i];
	if(x==y)return x;
	for(int i=19;~i;i--)
		if(f[x][i]^f[y][i])
			x=f[x][i],y=f[y][i];
	return f[x][0];
}
void dfs2(int u,int f)
{
	ans[u]-=bs[w[u]+d[u]]+bt[w[u]-d[u]+eps];
	for(int i=h[u];i;i=e[i].n)
		if(e[i].v^f)
			dfs2(e[i].v,u);
	int x;
	x=s[u].size();fo(i,0,x-1)bs[s[u][i]]++;
	x=t[u].size();fo(i,0,x-1)bt[t[u][i]+eps]++;
	x=l[u].size();fo(i,0,x-1)bs[l[u][i]]--;
	ans[u]+=bs[w[u]+d[u]]+bt[w[u]-d[u]+eps];
	x=l[u].size();fo(i,0,x-1)bt[l[u][i]-2*d[u]+eps]--;
}
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x<y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("runninga.in","r",stdin);freopen("runninga.out","w",stdout);
	n=read();m=read();
	fo(i,1,n-1)x=read(),y=read(),ad(x,y),ad(y,x);
	fo(i,1,n)w[i]=read();
	dfs1(1,0);init();
	while(m--)
	{
		x=read();y=read();z=lca(x,y);
		s[x].push_back(d[x]);t[y].push_back(d[x]-2*d[z]);
		l[z].push_back(d[x]);
	}
	dfs2(1,0);
	fo(i,1,n)printf("%lld ",ans[i]);
	return 0;
}