B'You are given a set of strings S . Each string consists of lowercase Latin letters. For each string in this set, you want to calculate the minimum number of seconds required to type this string. To type a string, you have to start with an empty string and transform it into the string you want to type using the following actions: What is the minimum number of seconds that you have to spend to type each string from S ? Note that the strings from S are given in an unusual way. The first line contains one integer n ( 1 <= n <= 10^6 ). Then n lines follow, the i -th line contains one integer p_i ( 0 <= p_i < i ) and one lowercase Latin character c_i . These lines form some set of strings such that S is its subset as follows: there are n + 1 strings, numbered from 0 to n ; the 0 -th string is an empty string, and the i -th string ( i ge 1 ) is the result of appending the character c_i to the string p_i . It is guaranteed that all these strings are distinct. The next line contains one integer k ( 1 <= k <= n ) -- the number of strings in S . The last line contains k integers a_1 , a_2 , ..., a_k ( 1 <= a_i <= n , all a_i are pairwise distinct) denoting the indices of the strings generated by above-mentioned process that form the set S -- formally, if we denote the i -th generated string as s_i , then S = {s_{a_1}, s_{a_2}, ... , s_{a_k}} . Print k integers, the i -th of them should be equal to the minimum number of seconds required to type the string s_{a_i} . In the first example, S consists of the following strings: ieh, iqgp, i, iqge, ier. '...