Codeforces Round #379 (Div. 2) E. Anton and Tree 树的直径

E. Anton and Tree

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Anton is growing a tree in his garden. In case you forgot, the tree is a connected acyclic undirected graph.

There are n vertices in the tree, each of them is painted black or white. Anton doesn't like multicolored trees, so he wants to change the tree such that all vertices have the same color (black or white).

To change the colors Anton can use only operations of one type. We denote it as paint(v), where v is some vertex of the tree. This operation changes the color of all vertices u such that all vertices on the shortest path from v to u have the same color (including v and u). For example, consider the tree

and apply operation paint(3) to get the following:

Anton is interested in the minimum number of operation he needs to perform in order to make the colors of all vertices equal.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of vertices in the tree.

The second line contains n integers color_i (0 ≤ color_i ≤ 1) — colors of the vertices. color_i = 0 means that the i-th vertex is initially painted white, while color_i = 1 means it's initially painted black.

Then follow n - 1 line, each of them contains a pair of integers u_i and v_i (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i) — indices of vertices connected by the corresponding edge. It's guaranteed that all pairs (u_i, v_i) are distinct, i.e. there are no multiple edges.

Output

Print one integer — the minimum number of operations Anton has to apply in order to make all vertices of the tree black or all vertices of the tree white.

Examples

Input

11
0 0 0 1 1 0 1 0 0 1 1
1 2
1 3
2 4
2 5
5 6
5 7
3 8
3 9
3 10
9 11

Output

2

Input

4
0 0 0 0
1 2
2 3
3 4

Output

0

Note

In the first sample, the tree is the same as on the picture. If we first apply operation paint(3) and then apply paint(6), the tree will become completely black, so the answer is 2.

In the second sample, the tree is already white, so there is no need to apply any operations and the answer is 0.

题意：你每次去一个点，可以将其同色的联通块一起变色，求最后变为一色的最少次数；

思路：将同色的看作一个点，每次去树的直径的中点即是最小次数；

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=1e6+,M=1e6+,inf=1e9+;
const ll INF=1e18+,mod=;
int clo[N];
struct is
{
    int v,next;
}edge[N];
int head[N],edg;
int node1,ans;
void init()
{
    edg=;
    memset(head,-,sizeof(head));
}
void add(int u,int v)
{
    edg++;
    edge[edg].v=v;
    edge[edg].next=head[u];
    head[u]=edg;
}
void dfs(int u,int fa,int deep)
{
    if(deep>ans)
    {
        ans=deep;
        node1=u;
    }
    for(int i=head[u];i!=-;i=edge[i].next)
    {
        int v=edge[i].v;
        if(v==fa)continue;
        if(clo[v]!=clo[u])
        dfs(v,u,deep+);
        else
        dfs(v,u,deep);
    }
}
int main()
{
    init();
    int n;
    scanf("%d",&n);
    for(int i=;i<=n;i++)
        scanf("%d",&clo[i]);
    for(int i=;i<n;i++)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v);
        add(v,u);
    }
    dfs(,-,);
    dfs(node1,-,);
    cout<<(ans+)/<<endl;
    return ;
}