#include <bits/stdc++.h>
    
using namespace std;
    
typedef long long ll;
    
const int  N = (1 << 20) + 12, MOD = (int)1e9 + 7;

int n, m, a[N], vis[N], timer, p[N];
vector<int> g[N], gt[N];
bool is[N];
map<int, int> dist[N];
int f(int d) {
    timer++;
    vis[d] = timer;
    int lst = d;
    queue<int> q;
    q.push(d);
    dist[d][d] = 0;
    while(!q.empty()) {
        int v = q.front();
        lst = v;
        q.pop();
        for(int to : g[v]) {
            if(vis[to] != timer) {
                dist[d][to] = dist[d][v] + 1;
                q.push(to);
                vis[to] = timer;
            }
        }
    }
    return lst;
}
int col[N], dep[N], mxd[N], res[N], d, d1, o, cr;
int zap = 0;
bool ok[N];
void dfs(int v, int pr = -1) {
    mxd[v] = dep[v];
    for(int to:g[v]) if(to != pr) {
        gt[v].push_back(to);
        dep[to] = dep[v] + 1;
        dfs(to, v);
        mxd[v] = max(mxd[v], mxd[to]);
    }
    for(int i = 0; i < (int)gt[v].size(); i++) {
        if(mxd[gt[v][i]] == mxd[v]) {
            swap(gt[v][0], gt[v][i]);
        }
    }
}

vector<int> st;
multiset<int> cur;
void go(int v) {
    if(dist[cr][v] > dist[o][v] || (dist[cr][v] == dist[o][v] && zap)) {
        // set<int> raz;
        int l = -1,r = (int)st.size();
        while(r - l > 1) {
            int mid = (l + r) >> 1;
            if(mxd[v] - dep[v] < dep[v] - dep[st[mid]]) {
                l = mid;
            } else {
                r = mid;
            }
        }
        res[v] += (l + 1);
        // res[v] += (int)raz.size();
    }
    if(gt[v].empty()) return;
    int sz = (int)gt[v].size();
    vector<int> p(sz), s(sz);
    p[0] = mxd[gt[v][0]];
    s[sz - 1] = mxd[gt[v][sz - 1]];
    for(int i = 1; i < sz; i++) {
        p[i] = max(p[i - 1], mxd[gt[v][i]]);
    }
    for(int i = sz - 2; i >= 0; i--) {
        s[i] = max(s[i + 1], mxd[gt[v][i]]);
    }
    vector<int> del;
    for(int i = 0; i < sz; i++) {
        int to = gt[v][i];
        int mx = dep[v];
        if(i) mx = max(mx, p[i - 1]);
        if(i < sz - 1) mx = max(mx, s[i + 1]);
        mx -= dep[v];
        if(i == 1 && !st.empty() && st.back() == v) {
            cur.erase(cur.find(a[v]));
            st.pop_back();
        }
        if(i <= 1) {
            while(!st.empty() && dep[v] - dep[st.back()] <= mx) {
                del.push_back(st.back());
                cur.erase(cur.find((a[st.back()])));
                st.pop_back();
            }
        }
        if(i <= 1 && (cur.find(a[v]) == cur.end())) {
            cur.insert(a[v]);
            st.push_back(v);
        }
        go(to);
    }
    if(!st.empty() && st.back() == v) {
        cur.erase(cur.find(a[v]));
        st.pop_back();
    }
    reverse(del.begin(), del.end());
    for(int j:del) {
        st.push_back(j);
        cur.insert(a[j]);
    }
}
void solve(int root) {
    for(int i = 1; i <= n; i++) {
        gt[i].clear();
    }
    st.clear();
    dep[root] = 1;
    dfs(root);

    go(root);
}
void test() {
    cin >> n >> m;
    for(int i = 1; i <= n - 1; i++) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }

    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    d = f(1), d1 = f(d);
    f(d1);
    o = d1;cr = d;
    solve(d);
    zap = 1;
    o = d;cr = d1;
    solve(d1);
    for(int i = 1; i <= n; i++) {
        cout << res[i] << '\n';
    }

}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t = 1; 
    // cin >> t;

    while(t--) 
        test();
}