#include using namespace std; #define fst(t) std::get<0>(t) #define snd(t) std::get<1>(t) #define thd(t) std::get<2>(t) using ll = long long; using P = std::tuple; const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1}; int N; string nodes; vector G[100000]; int c_cnts[100000]; ll rec(int u, int p, int c_cnt, int w_cnt, ll cw_cnt){ ll res = 0ll; if(nodes[u] == 'c'){ res = 1ll * w_cnt * (w_cnt - 1) / 2; }else{ // res = cw_cnt; } // printf("at %d, get %lld as bonus\n", u, res); for(auto v : G[u]){ if(v == p){continue;} if(nodes[u] == 'c'){ res += rec(v, u, c_cnt + 1, w_cnt, cw_cnt); }else{ res += rec(v, u, c_cnt, w_cnt + 1, cw_cnt + c_cnt); } } return res; } int dfs(int u, int p){ int res = nodes[u] == 'c'; for(int v : G[u]){ if(v == p){continue;} res += dfs(v, u); } return c_cnts[u] = res; } tuple rec2(int u, int p){ ll res = 0ll, all_w_cnt = 0; for(auto v : G[u]){ if(v == p){continue;} ll child_res, w_cnt; tie(child_res, w_cnt) = rec2(v, u); res += child_res; if(nodes[u] == 'w'){ // printf("added %lld at %d ; c: %d, w_cnt: %lld\n", 1ll * (c_cnts[0] - c_cnts[v]) * w_cnt, u, c_cnts[0] - c_cnts[v], w_cnt); // printf("n, w_cnt: %d, %lld (%d)\n", n, w_cnt, u); res += 1ll * (c_cnts[0] - c_cnts[v]) * w_cnt; } all_w_cnt += w_cnt; } if(nodes[u] == 'w'){++all_w_cnt;} return std::make_tuple(res, all_w_cnt); } int main(){ //* std::cin.tie(nullptr); std::ios::sync_with_stdio(false); /*/ /*/ std::cin >> N; std::cin >> nodes; for(int i=0;i> a >> b; --a; --b; G[a].emplace_back(b); G[b].emplace_back(a); } dfs(0, -1); ll res = rec(0, -1, 0, 0, 0) + fst(rec2(0, -1)); printf("%lld\n", res); }