#1082 · Đếm màu cây - COUNT

#include <iostream>
#include <vector>
#include <set>

using namespace std;

vector<vector<int>> adj;
vector<bool> visited;
vector<set<int>> M;

void DFS(int u) {
    visited[u] = true;
    for (int v : adj[u]) {
        if (!visited[v]) {
            DFS(v);
            M[u].insert(M[v].begin(), M[v].end());
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n,u,v,i,x;
    cin >> n;

    adj.resize(n + 1);
    visited.resize(n + 1, false);
    M.resize(n + 1);

    for (i = 1; i <= n - 1; ++i) {
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    for (i = 1; i <= n; ++i) {
        cin >> x;
        M[i].insert(x);
    }
    DFS(1);
    for (i = 1; i <= n; ++i) {
        cout << M[i].size() << " ";
    }
    return 0;
}