#include<bits/stdc++.h>
using namespace std;

vector<int> dfs(int i, vector<vector<int>>& graph, unordered_set<int>& visited, vector<int>& result) {
    if (visited.find(i) != visited.end()) {
        return {0, 0};
    }
    visited.insert(i);
    int black = 0, white = 0;
    vector<int> numC;
    for (auto j: graph[i]) {
        numC = dfs(j, graph, visited, result);
        black += numC[0];
        white += numC[1];
    }
    string[i - 1] == '1' ? ++black : ++white;
    result[i - 1] = black * white;
    return {black, white};
}

vector<int> solve(int N, string Color, vector<vector<int>> Edges) {
    vector<vector<int>> graph(N + 1);
    unordered_set<int> visited;
    vector<int> result(N);
    
    for (auto edge: Edges) {
        graph[edge[0]].push_back(edge[1]);
        graph[edge[1]].push_back(edge[0]);
    }
    
    dfs(1, graph, visited, result);
    return result;
}