## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

# [Solution] XOR Tree Codeforces Solution 2022 | Solution Codeforces

E. XOR Tree
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a tree consisting of $n$ vertices. A number is written on each vertex; the number on vertex $i$ is equal to ${a}_{i}$.

Recall that a simple path is a path that visits each vertex at most once. Let the weight of the path be the bitwise XOR of the values written on vertices it consists of. Let's say that a tree is good if no simple path has weight $0$.

You can apply the following operation any number of times (possibly, zero): select a vertex of the tree and

Solution Click Below:-  👉
👇👇👇👇👇

replace the value written on it with an arbitrary positive integer. What is the minimum number of times you have to apply this operation in order to make the tree good?

Input

The first line contains one integer $n$ ($1\le n\le 2\cdot {10}^{5}$) — the number of vertices.

Three Doors Codeforces Solution 2022

Also Try Minecraft Codeforces Solution

Recover an RBS Codeforces Solution

Rorororobot Codeforces Solution

XOR Tree Codeforces Solution

Multiset of Strings Codeforces Solution

The second line contains $n$ integers ${a}_{1}$${a}_{2}$, ..., ${a}_{n}$ ($1\le {a}_{i}<{2}^{30}$) — the numbers written on vertices.

Then $n-1$ lines follow, each containing two integers $x$ and $y$ ($1\le x,y\le n;x\ne y$) denoting an edge connecting vertex $x$ with vertex $y$. It is guaranteed that these edges form a tree.

Output

Print a single integer — the minimum number of times you have to apply the operation in order to make the tree good.