#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
#define Add(x, y) x = (x + (y)) % mod
#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to, cost;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;
    vec dp1, dp2;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
        dp1.resize(N);
        dp2.resize(N);
    }

    void add_Directed_edge(int from, int to, int cost = 1){
        G[from].push_back(edge({to, cost}));
    }

    void add_Undirected_edge(int v1, int v2, int cost = 1){
        add_Directed_edge(v1, v2, cost);
        add_Directed_edge(v2, v1, cost);
    }

    void dfs1(int v, string &S, int p = -1){
        dp1[v] = 0;
        dp2[v] = 0;
        for(auto e: G[v]) if(e.to != p){
            dfs1(e.to, S, v);
            dp1[v] += dp1[e.to];
            dp2[v] += dp1[e.to] + dp2[e.to];
        }
        if(S[v] == '1') dp1[v]++;    
    }

    void dfs2(int v, int p = -1){
        int M = 0, S = 0, i0;
        for(auto e: G[v]) if(e.to != p){
            S += dp1[e.to] + dp2[e.to];
            if(dp1[e.to] + dp2[e.to] > M){
                M = dp1[e.to] + dp2[e.to];
                i0 = e.to;
            }
        }
        S -= M;
        if(M > 0){
            dfs2(i0, v);
            dp2[v] = max(0LL, dp1[i0] + dp2[i0] - S);
        }
    }
};

signed main(){

    int N; cin >> N;
    string S; cin >> S;
    Graph G(N);
    int a, b;
    REP(i, N - 1){
        cin >> a >> b;
        G.add_Undirected_edge(a - 1, b - 1);
    }
    int ans = INF;
    REP(i, N){
        G.dfs1(i, S);
        int val = G.dp2[i];
        if(val % 2 == 0){
            G.dfs2(i);
            if(G.dp2[i] == 0){
                //debug(i);
                //vdebug(G.dp2);
                Min(ans, val / 2);
            }
        }
    }
    if(ans < INF) Out(ans);
    else Out(-1);

    return 0;
}


Measured memory_bytes: 512