#include <bits/stdc++.h>
using namespace std;
const int N = (int) 2e5 + 7;
int n;
int sol;
int dp[N];
int is[N];
vector<int> g[N];
string s;
void build(int a, int p = -1) {
dp[a] = 0;
for (auto &b : g[a]) {
if (b != p) {
build(b, a);
dp[a] += dp[b];
}
}
dp[a] -= is[a];
int dp2 = 0;
for (auto &b : g[a]) {
if (b != p) {
dp2 = max(dp2, dp[a]);
}
}
dp[a] = max(dp[a], dp2 + is[a]);
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
///freopen ("input.txt", "r", stdin);
cin >> n;
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
cin >> s;
for (int i = 1; i <= n; i++) {
is[i] = s[i - 1] - '0';
}
for (int i = 1; i <= n; i++) {
build(i);
sol = max(sol, dp[i]);
}
cout << sol << "\n";
return 0;
}
