// NOIP2016 天天爱跑步
#include <cstdio>
#include <algorithm>
using namespace std;

#define N 300005
#define mid ((l + r) >> 1)

int n, m;
int head[N << 1], ver[N << 1], nxt[N << 1];
int dep[N], lg[N], f[N][20];
int w[N], ans[N];
int rt[N][2];
int lc[N * 80], rc[N * 80], cnt[N * 80];

void add(int u, int v) {
    static int tot = 0;
    ver[++tot] = v;
    nxt[tot] = head[u];
    head[u] = tot;
}

void dfs(int u, int fa) {
    f[u][0] = fa;
    dep[u] = dep[fa] + 1;

    for (int i = 1; i <= lg[dep[u]]; i++) {
        f[u][i] = f[f[u][i - 1]][i - 1];
    }

    for (int i = head[u]; i; i = nxt[i]) {
        int v = ver[i];

        if (v != fa)
            dfs(v, u);
    }
}

int lca(int x, int y) {
    if (dep[x] < dep[y])
        swap(x, y);

    while (dep[x] > dep[y]) {
        x = f[x][lg[dep[x] - dep[y]]];
    }

    if (x == y)
        return x;

    for (int i = lg[dep[x]]; i >= 0; i--) {
        if (f[x][i] != f[y][i]) {
            x = f[x][i];
            y = f[y][i];
        }
    }

    return f[x][0];
}

void change(int x, int v, int l, int r, int &p) {
    static int tot = 0;

    if (!p)
        p = ++tot;

    if (l == r) {
        cnt[p] += v;
        return;
    }

    if (x <= mid)
        change(x, v, l, mid, lc[p]);
    else
        change(x, v, mid + 1, r, rc[p]);

    cnt[p] = cnt[lc[p]] + cnt[rc[p]];
}

int query(int x, int l, int r, int p) {
    if (!p)
        return 0;

    if (l == r)
        return cnt[p];

    if (x <= mid)
        return query(x, l, mid, lc[p]);
    else
        return query(x, mid + 1, r, rc[p]);
}

int merge(int p, int q, int l, int r) {
    if (!p)
        return q;

    if (!q)
        return p;

    if (l == r) {
        cnt[p] += cnt[q];
        return p;
    }

    lc[p] = merge(lc[p], lc[q], l, mid);
    rc[p] = merge(rc[p], rc[q], mid + 1, r);
    cnt[p] = cnt[lc[p]] + cnt[rc[p]];
    return p;
}

void sum(int u, int fa) {
    for (int i = head[u]; i; i = nxt[i]) {
        int v = ver[i];

        if (v == fa)
            continue;

        sum(v, u);
        rt[u][0] = merge(rt[u][0], rt[v][0], 1, n);
        rt[u][1] = merge(rt[u][1], rt[v][1], -n, 2 * n);
    }

    int res = dep[u] + w[u] <= n ? query(dep[u] + w[u], 1, n, rt[u][0]) : 0;
    ans[u] = res + query(dep[u] - w[u], -n, 2 * n, rt[u][1]);
}

int main() {
    scanf("%d %d", &n, &m);

    for (int i = 2; i <= n; i++)
        lg[i] = lg[i >> 1] + 1;

    for (int i = 1, u, v; i < n; i++) {
        scanf("%d %d", &u, &v);
        add(u, v);
        add(v, u);
    }

    for (int i = 1; i <= n; i++)
        scanf("%d", w + i);

    dfs(1, 0);

    for (int i = 1, s, t, p; i <= m; i++) {
        scanf("%d %d", &s, &t);
        p = lca(s, t);
        // 点差分
        change(dep[s], 1, 1, n, rt[s][0]);
        change(dep[s], -1, 1, n, rt[p][0]);
        change(2 * dep[p] - dep[s], 1, -n, 2 * n, rt[t][1]);
        change(2 * dep[p] - dep[s], -1, -n, 2 * n, rt[f[p][0]][1]);
    }

    sum(1, 0);

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

    return 0;
}