B'Easy and hard versions are actually different problems, so we advise you to read both statements carefully. You are given a weighted rooted tree, vertex 1 is the root of this tree. Also, each edge has its own cost. A tree is a connected graph without cycles. A rooted tree has a special vertex called the root. A parent of a vertex v is the last different from v vertex on the path from the root to the vertex v . Children of vertex v are all vertices for which v is the parent. A vertex is a leaf if it has no children. The weighted tree is such a tree that each edge of this tree has some weight. The weight of the path is the sum of edges weights on this path. The weight of the path from the vertex to itself is 0 . You can make a sequence of zero or more moves. On each move, you select an edge and divide its weight by 2 rounding down. More formally, during one move, you choose some edge i and divide its weight by 2 rounding down ( w_i := <= ft lfloor frac{w_i}{2} right rfloor ). Each edge i has an associated cost c_i which is either 1 or 2 coins. Each move with edge i costs c_i coins. Your task is to find the minimum total cost to make the sum of weights of paths from the root to each leaf at most S . In other words, if w(i, j) is the weight of the path from the vertex i to the vertex j , then you have to make sum limits_{v in leaves} w(root, v) <= S , where leaves is the list of all leaves. You have to answer t independent test cases. The first line of the input contains one integer t ( 1 <= t <= 2 cdot 10^4 ) -- the number of test cases. Then t test cases follow. The first line of the test case contains two integers n and S ( 2 <= n <= 10^5; 1 <= S <= 10^{16} ) -- the number of vertices in the tree and the maximum possible sum of weights you have to obtain. The next n-1 lines'...