#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    string s;
    cin >> s;

    vector<vector<int>> adj(n);
    for (int i = 1; i < n; ++i) {
        int a, b;
        cin >> a >> b;
        --a, --b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    auto bfs = [&](auto source) -> vector<int> {
        vector<int> dist(n, -1);
        dist[source] = 0;
        queue<int> q;
        q.push(source);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            for (int to : adj[v]) {
                if (dist[to] == -1) {
                    dist[to] = dist[v] + 1;
                    q.push(to);
                }
            }
        }
        return dist;
    };

    vector<vector<int>> dist(n);
    for (int i = 0; i < n; ++i) {
        dist[i] = bfs(i);
    }

    vector<int> answer(n + 1, n + 1);
    for (int d = 0; d <= n; ++d) {
        for (int mask = 0; mask < (1 << n); ++mask) {
            vector<int> ill(n);
            for (int v = 0; v < n; ++v) {
                for (int i = 0; i < n; ++i) {
                    if ((mask >> i & 1) && dist[i][v] <= d) {
                        ill[v] = true;
                    }
                }
            }
            bool good = true;
            for (int i = 0; i < n; ++i) {
                if (s[i] - '0' != ill[i]) {
                    good = false;
                    break;
                }
            }
            if (good) {
                answer[d] = min(answer[d], __builtin_popcount(mask));
            }
        }
    }

    int q;
    cin >> q;
    while (q--) {
        int d;
        cin >> d;
        if (answer[d] > n) {
            cout << "-1\n";
        } else {
            cout << answer[d] << '\n';
        }
    }

    return 0;
}