#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
#define pb push_back
typedef long long LL;
#define fi first
#define se second
const int mod = 1e9 + 7;
const int N = 200022;
char st[N];
int siz[N];
int dp[N], sd[N], ans[N];
map<int, int> ss[N];
vector<int> e[N];
void f(int v) {
    
    if(st[v] == '0') {
        dp[v] = sd[v] + (ss[v].empty() ? 0 : (ss[v].rbegin())->fi);
    } else {
        dp[v] = sd[v];
    }
}
void dfs(int v, int fa = -1) {
    siz[v] = st[v] == '1';
    sd[v] = 0;
    for(int y : e[v]) {
        if(y == fa) {
            continue;
        }
        dfs(y, v);
        siz[v] += siz[y];
        ss[v][siz[y]]++;
        sd[v] += dp[y];
    }
    f(v);
}
void inc(int fa, int v, int delta) {
    int val = (ss[fa][siz[v]] += delta);
    if(val == 0) {
        ss[fa].erase(siz[v]);
    }
}
void sfd(int v, int fa = -1) {

    if(fa != -1) {
        sd[fa] -= dp[v];
        siz[fa] -= siz[v];
        inc(fa, v, -1);
        f(fa);
        sd[v] += dp[fa];
        siz[v] += siz[fa];
        inc(v, fa, 1);
        f(v);
    }
    ans[v] = dp[v];
    //printf("!%d\n", dp[v]);
    for(int y : e[v]) {
        if(y == fa) {
            continue;
        }
        sfd(y, v);
    }
    if(fa != -1) {
        sd[v] -= dp[fa];
        siz[v] -= siz[fa];
        inc(v, fa, -1);
        f(v);
        sd[fa] += dp[v];
        siz[fa] += siz[v];
        inc(fa, v, 1);
        f(fa);
    }
}
int main() {
    int n;
    scanf("%d", &n);
    scanf("%s", st);
    for(int i = 0; i < n - 1; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        x--;
        y--;
        e[x].pb(y);
        e[y].pb(x);
    }
    dfs(0);
    sfd(0);
    for(int i = 0; i < n; i++) {
        printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
    }
}