Codeforces Round #396(Div. 2)E. Mahmoud and a xor trip

E. Mahmoud and a xor trip

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mahmoud and Ehab live in a country with n cities numbered from 1 to n and connected by n - 1 undirected roads. It's guaranteed that you can reach any city from any other using these roads. Each city has a number ai attached to it.

We define the distance from city x to city y as the xor of numbers attached to the cities on the path from x to y (including both x and y). In other words if values attached to the cities on the path from x to y form an array p of length l then the distance between them is , where  is bitwise xor operation.

Mahmoud and Ehab want to choose two cities and make a journey from one to another. The index of the start city is always less than or equal to the index of the finish city (they may start and finish in the same city and in this case the distance equals the number attached to that city). They can't determine the two cities so they try every city as a start and every city with greater index as a finish. They want to know the total distance between all pairs of cities.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of cities in Mahmoud and Ehab's country.

Then the second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 106) which represent the numbers attached to the cities. Integer ai is attached to the city i.

Each of the next n  -  1 lines contains two integers u and v (1  ≤  u,  v  ≤  n, u  ≠  v), denoting that there is an undirected road between cities u and v. It's guaranteed that you can reach any city from any other using these roads.

Output

Output one number denoting the total distance between all pairs of cities.

Examples

input

3
1 2 3
1 2
2 3

output

10

input

5
1 2 3 4 5
1 2
2 3
3 4
3 5

output

52

input

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

output

131

Note

A bitwise xor takes two bit integers of equal length and performs the logical xor operation on each pair of corresponding bits. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1. You can read more about bitwise xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR.

In the first sample the available paths are:

• city 1 to itself with a distance of 1,
• city 2 to itself with a distance of 2,
• city 3 to itself with a distance of 3,
• city 1 to city 2 with a distance of ,
• city 1 to city 3 with a distance of ,
• city 2 to city 3 with a distance of .

The total distance between all pairs of cities equals  1 + 2 + 3 + 3 + 0 + 1 = 10.

题意：树上有n个点，每个点有权值，定义两个点之间的距离为所经过的点的权值异或值，求所有对点的距离和。（自己和自己的距离为该点权值也要算）

思路：讲道理，这个不看题解我完全想不到，很巧妙的树形dp，枚举每一位，算出每一位的贡献值，即算出有多少对点的距离在该位是1的，那么ans+=对数*(1<<该位)即可，至于怎么个树形dp法，具体还是看代码吧，毕竟我说不清楚。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 100005
#define inf 0x3f3f3f3f
typedef long long LL;
const int mod = 1e9 + 7;
int value[maxn], head[maxn], dp[maxn][2];
LL ans;
struct node{
	int v, next;
}p[maxn << 1];
void dfs(int x, int fa,int index){
	int now = (value[x] >> index) & 1;
	dp[x][now] = 1;
	dp[x][now ^ 1] = 0;
	LL num = 0;
	for (int i = head[x]; ~i; i = p[i].next){
		if (p[i].v == fa)
			continue;
		dfs(p[i].v, x, index);
		num += dp[x][0] * dp[p[i].v][1] + dp[x][1] * dp[p[i].v][0];
		dp[x][now ^ 0] += dp[p[i].v][0];
		dp[x][now ^ 1] += dp[p[i].v][1];
	}
	ans += num << index;
}
int main(){
	int n;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++){
		scanf("%d", &value[i]);
		ans += value[i];
	}
	int len = 0;
	memset(head, -1, sizeof(head));
	while (--n){
		int u, v;
		scanf("%d%d", &u, &v);
		p[len].v = v;
		p[len].next = head[u];
		head[u] = len++;
		p[len].v = u;
		p[len].next = head[v];
		head[v] = len++;
	}
	for (int i = 0; i <= 20; i++){
		dfs(1, 0, i);
	}
	printf("%lld\n", ans);
}