#include<iostream>

#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<algorithm>

#include<vector>

using namespace std;

int read()

{

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

    while (c<''||c>'') {if (c=='-') f=-;c=getchar();}

    while (c>=''&&c<='') x=(x<<)+(x<<)+(c^),c=getchar();

    return x*f;

}

#define N 300010

int n,m,p[N],a[N],fa[N][],deep[N],ans[N],root[][N],cnt[]={},t=;

vector<int> op1[N],op2[N];

struct data{int to,nxt;

}edge[N<<];

struct data2{int l,r,x;

}tree[][N<<];

void addedge(int x,int y){t++;edge[t].to=y,edge[t].nxt=p[x],p[x]=t;}

void dfs(int k)

{

    for (int i=p[k];i;i=edge[i].nxt)

    if (edge[i].to!=fa[k][])

    {

        fa[edge[i].to][]=k;

        deep[edge[i].to]=deep[k]+;

        dfs(edge[i].to);

    }

}

int lca(int x,int y)

{

    if (deep[x]<deep[y]) swap(x,y);

    for (int j=;~j;j--) if (deep[fa[x][j]]>=deep[y]) x=fa[x][j];

    if (x==y) return x;

    for (int j=;~j;j--) if (fa[x][j]!=fa[y][j]) x=fa[x][j],y=fa[y][j];

    return fa[x][];

}

int merge(int x,int y,int l,int r,int p)

{

    if (!x||!y) return x|y;

    if (l==r) {tree[p][x].x+=tree[p][y].x;return x;}

    int mid=l+r>>;

    tree[p][x].l=merge(tree[p][x].l,tree[p][y].l,l,mid,p);

    tree[p][x].r=merge(tree[p][x].r,tree[p][y].r,mid+,r,p);

    return x;

}

void ins(int &k,int x,int l,int r,int v,int p)

{

    if (!k) k=++cnt[p];

    if (l==r) {tree[p][k].x+=v;return;}

    int mid=l+r>>;

    if (x<=mid) ins(tree[p][k].l,x,l,mid,v,p);

    else ins(tree[p][k].r,x,mid+,r,v,p);

}

int query(int k,int l,int r,int x,int p)

{

    if (!k) return ;

    if (l==r) return tree[p][k].x;

    int mid=l+r>>;

    if (x<=mid) return query(tree[p][k].l,l,mid,x,p);

    else return query(tree[p][k].r,mid+,r,x,p);

}

void getans(int k)

{

    for (int i=p[k];i;i=edge[i].nxt)

    if (edge[i].to!=fa[k][])

    {

        getans(edge[i].to);

        root[][k]=merge(root[][k],root[][edge[i].to],,n<<,);

        root[][k]=merge(root[][k],root[][edge[i].to],,n<<,);

    }

    for (int i=;i<op1[k].size();i++)

    if (op1[k][i]>) ins(root[][k],op1[k][i],,n<<,,);

    else ins(root[][k],-op1[k][i],,n<<,-,);

    for (int i=;i<op2[k].size();i++)

    if (op2[k][i]>) ins(root[][k],op2[k][i],,n<<,,);

    else ins(root[][k],-op2[k][i],,n<<,-,);

    ans[k]+=query(root[][k],,n<<,deep[k]+a[k],)+query(root[][k],,n<<,deep[k]-a[k]+n,);

}

int main()

{

#ifndef ONLINE_JUDGE

    freopen("bzoj4719.in","r",stdin);

    freopen("bzoj4719.out","w",stdout);

#endif

    n=read(),m=read();

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

    {

        int x=read(),y=read();

        addedge(x,y),addedge(y,x);

    }

    fa[][]=;dfs();

    for (int j=;j<;j++)

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

        fa[i][j]=fa[fa[i][j-]][j-];

    for (int i=;i<=n;i++) a[i]=read();

    for (int i=;i<=m;i++)

    {

        int x=read(),y=read(),l=lca(x,y);

        if (l!=x) op1[x].push_back(deep[x]),op1[l==?:fa[l][]].push_back(-deep[x]);

        if (l!=y) op2[y].push_back(deep[l]*-deep[x]+n),op2[l==x?(l==?:fa[l][]):l].push_back(deep[x]-deep[l]*-n);

        if (l==x&&l==y&&a[l]==) ans[l]++;

    }

    getans();

    for (int i=;i<=n;i++) printf("%d ",ans[i]);

    return ;

}