24576번 - Good Influencers 서브태스크다국어

There are N (N ≥ 2) students in a computer science class, with distinct student IDs ranging from 1 to N. There are N − 1 friendships amongst the students, with the ith being between students A_i and B_i (A_i ≠ B_i, 1 ≤ A_i ≤ N and 1 ≤ B_i ≤ N). Each pair of students in the class are either friends or socially connected. A pair of students a and b are socially connected if there exists a set of students m₁, m₂, . . . , m_k such that

• a and m₁ are friends,
• m_i and m_i+1 are friends (for 1 ≤ i ≤ k − 1), and
• m_k and b are friends.

Initially, each student i either intends to write the CCC (if P_i is Y) or does not intend to write the CCC (if P_i is N). Initially, at least one student intends to write the CCC, and at least one student does not intend to write the CCC.

The CCC has allocated some funds to pay some students to be influencers for the CCC. The CCC will repeatedly choose one student i who intends to write the CCC, pay them C_i dollars, and ask them to deliver a seminar to all of their friends, and then all of their friends will intend to write the CCC.

Help the CCC determine the minimum cost required to have all of the students intend to write the CCC.

The first line contains the integer N.

The next N − 1 lines each contain two space-separated integers, A_i and B_i (1 ≤ i ≤ N − 1).

The next line contains N characters, P₁ . . . P_N, each of which is either Y or N.

The next line contains N space-separated integers, C₁ . . . C_N.

Output the minimum integer number of dollars required to have all of the students to intend to write the CCC.