B'You are the owner of a menagerie consisting of n animals numbered from 1 to n . However, maintaining the menagerie is quite expensive, so you have decided to sell it! It is known that each animal is afraid of exactly one other animal. More precisely, animal i is afraid of animal a_i ( a_i neq i ). Also, the cost of each animal is known, for animal i it is equal to c_i . You will sell all your animals in some fixed order. Formally, you will need to choose some permutation ^ dagger p_1, p_2, ldots, p_n , and sell animal p_1 first, then animal p_2 , and so on, selling animal p_n last. When you sell animal i , there are two possible outcomes: Your task is to choose the order of selling the animals in order to maximize the total profit. For example, if a = [3, 4, 4, 1, 3] , c = [3, 4, 5, 6, 7] , and the permutation you choose is [4, 2, 5, 1, 3] , then: Your total profit, with this choice of permutation, is 12 + 4 + 14 + 6 + 5 = 41 . Note that 41 is not the maximum possible profit in this example. ^ dagger A permutation of length n is an array consisting of n distinct integers from 1 to n in any order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation ( 2 appears twice in the array) and [1,3,4] is also not a permutation ( n=3 , but 4 is present in the array). The first line of the input contains an integer t ( 1 <= t <= 10^4 ) -- the number of test cases. Then follow the descriptions of the test cases. The first line of each test case description contains an integer n ( 2 <= n <= 10^5 ) -- the number of animals. The second line of the test case description contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= n , a_i neq i ) -- a_i means the index of the animal that animal i is afraid of. The third line of'...