Problem: You are given a tree with N vertices numbered 1, 2, ..., N. The i-th edge connects Vertex a_i and Vertex b_i. You are also given a string S of length N consisting of `0` and `1`. The i-th character of S represents the number of pieces placed on Vertex i.

Snuke will perform the following operation some number of times:

* Choose two pieces the distance between which is at least 2, and bring these pieces closer to each other by 1. More formally, choose two vertices u and v, each with one or more pieces, and consider the shortest path between them. Here the path must contain at least two edges. Then, move one piece from u to its adjacent vertex on the path, and move one piece from v to its adjacent vertex on the path.



By repeating this operation, Snuke wants to have all the pieces on the same vertex. Is this possible? If the answer is yes, also find the minimum number of operations required to achieve it.

Constraints

* 2 \leq N \leq 2000
* |S| = N
* S consists of `0` and `1`, and contains at least one `1`.
* 1 \leq a_i, b_i \leq N(a_i \neq b_i)
* The edges (a_1, b_1), (a_2, b_2), ..., (a_{N - 1}, b_{N - 1}) forms a tree.

Input

Input is given from Standard Input in the following format:


N
S
a_1 b_1
a_2 b_2
:
a_{N - 1} b_{N - 1}


Output

If it is impossible to have all the pieces on the same vertex, print `-1`. If it is possible, print the minimum number of operations required.

Examples

Input

7
0010101
1 2
2 3
1 4
4 5
1 6
6 7


Output

3


Input

7
0010110
1 2
2 3
1 4
4 5
1 6
6 7


Output

-1


Input

2
01
1 2


Output

0

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

const int N = 2010;

struct edge {
    int to, next;
} e[N * 2];

int head[N], ecnt;

inline void adde(int from, int to) {
    e[++ecnt] = (edge){to, head[from]}, head[from] = ecnt;
    e[++ecnt] = (edge){from, head[to]}, head[to] = ecnt;
}

// sum: 子树内棋子个数 dp: 子树内最少操作步数
int sum[N], dp[N];

int val[N];

void dfs(int u, int f) {
    sum[u] = val[u], dp[u] = 0;
    for (int i = head[u]; i; i = e[i].next)
        if (e[i].to != f) {
            dfs(e[i].to, u);
            sum[u] += sum[e[i].to], dp[u] += dp[e[i].to] + sum[e[i].to];
        }
}

// 子树的最小剩余深度
int dfs2(int u, int f) {
    int mx = 0;
    for (int i = head[u]; i; i = e[i].next)
        if (e[i].to != f) 
            if (dp[e[i].to] >= dp[mx]) 
                mx = e[i].to;
    if (!mx) return 0;
    int tmp = dfs2(mx, u) + sum[mx];
    if (dp[u] - dp[mx] - sum[mx] >= tmp) return dp[u] & 1;
    return tmp - (dp[u] - dp[mx] - sum[mx]);
}

char s[N];

int main() {
    int n; scanf("%d%s", &n, s + 1);
    for (int i = 1; i <= n; i++) val[i] = s[i] == '1';
    for (int i = 1, a, b; i < n; i++) scanf("%d%d", &a, &b), adde(a, b);
    int res = 1e9;
    for (int i = 1; i <= n; i++) {
        dfs(i, 0);
        if (!dfs2(i, 0)) res = min(res, dp[i] / 2);
    }
    if (res < 1e8) printf("%d\n", res);
    else puts("-1");
    return 0;
}//