#include <bits/stdc++.h>
using namespace std;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
vector<vector<int>> adj(n + 1);
for(int i = 1; i <= n - 1; i++){
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vector<int> typ(n + 1);
for (int i = 1; i <= n; ++i) cin >> typ[i];
vector<int> dist(n + 1), len(n + 1), res(n + 1, 0);
function<void(int, int, int)> dfs = [&](int u, int p, int d){
dist[u] = d;
len[u] = 0;
for(int v: adj[u]){
if(v == p) continue;
dfs(v, u, d + 1);
len[u] = max(len[u], len[v] + 1);
}
};
vector<int> cnt(m + 1);
int resact = 0;
vector<int> pila;
function<void(int, int)> ndfs = [&](int u, int p){
vector<pair<int, int>> radj;
for(int v : adj[u]){
if(v != p) radj.push_back({len[v] + 1, v});
}
sort(radj.begin(), radj.end(), greater<pair<int, int>>());
int mx = (radj.size() > 1 ? radj[1].first : 0);
for(auto [d, v]: radj){
while(!pila.empty() && mx >= dist[u] - dist[pila.back()]){
if(--cnt[typ[pila.back()]] == 0) resact--;
pila.pop_back();
}
pila.push_back(u);
if(++cnt[typ[u]] == 1) resact++;
ndfs(v, u);
if(!pila.empty() && pila.back() == u){
pila.pop_back();
if(--cnt[typ[u]] == 0) resact--;
}
mx = max(mx, d);
}
while(!pila.empty() && mx >= dist[u] - dist[pila.back()]){
if(--cnt[typ[pila.back()]] == 0) resact--;
pila.pop_back();
}
res[u] = max(res[u], resact);
};
dfs(1, 0, 0);
int d1 = max_element(dist.begin(), dist.end()) - dist.begin();
dfs(d1, 0, 0);
ndfs(d1, -1);
int d2 = max_element(dist.begin(), dist.end()) - dist.begin();
dfs(d2, -1, 0);
ndfs(d2, -1);
for(int i = 1; i <= n; i++) cout << res[i] << "\n";
}
