country of Hackerland can be represented as a tree of tree$\_$nodes nodes indexed from $1$ to tree$\_$nodes. The ith edge is a bidirectional connection between the nodes numbered tree$\_$fromfi$]$ and tree$\_$to$[$l$]$ and has a weight tree$\_$weightfi$].$ Each node i is associated with an integer arrfif. The tree is rooted at node index $1$:A tree is special if there is a pair of vertices indexes xand y such that:ylies in the subtree of xThere is no instance of arry$]<$ distance$($x$,$ y$)$ where distance$($x$,$ y$)$ is the sum of weights of the edges on the path between nodes and yA leaf of the tree is a node connectedi to a single node by a single edge. In one operation, any one leaf is removed from the tree. The root of the tree cannot be removed. Find the minimum number of leaves that must be removed in order to make the tree special.