Kefa decided to celebrate his first big salary by going to the restaurant. He lives by an unusual park. The park is a rooted tree consisting of $n$ vertices with the root at vertex $1$. Vertex $1$ also contains Kefa's house. Unfortunately for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them. The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than $m$ consecutive vertices with cats. Your task is to help Kefa count the number of restaurants where he can go. \InputFile The first line contains two integers $n$ and $m~(2 \le n \le 10^5, 1 \le m \le n)$ --- the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa. The second line contains $n$ integers $a_1, a_2, ..., a_n$, where each $a_i$ either equals to $0$ (then vertex $i$ has no cat), or equals to $1$ (then vertex $i$ has a cat). Next $n - 1$ lines contains the edges of the tree in the format $x_i~y_i~(1  \le x_i, y_i \le n, x_i \ne y_i)$, where $x_i$ and $y_i$ are the vertices of the tree, connected by an edge. It is guaranteed that the given set of edges specifies a tree. \OutputFile Print the number of distinct leaves of a tree the path to which from Kefa's home contains at most $m$ consecutive vertices with cats. \includegraphics{https://static.eolymp.com/content/91/91715fb9b3c62508d624b9676dc254628b788aff.gif}