B"Keksic keeps getting left on seen by Anji. Through a mutual friend, he's figured out that Anji really likes binary trees and decided to solve her problem in order to get her attention. Anji has given Keksic a binary tree with n vertices. Vertex 1 is the root and does not have a parent. All other vertices have exactly one parent. Each vertex can have up to 2 children, a left child, and a right child. For each vertex, Anji tells Keksic index of both its left and its right child or tells him that they do not exist. Additionally, each of the vertices has a letter s_i on it, which is either 'U', 'L' or 'R'. Keksic begins his journey on the root, and in each move he does the following: You are interested in the minimal number of operations he needs to do before his journey, such that when he starts his journey, he will reach a leaf at some point. A leaf is a vertex that has no children. It does not matter which leaf he reaches. Note that it does not matter whether he will stay in the leaf, he just needs to move to it. Additionally, note that it does not matter how many times he needs to move before reaching a leaf. Help Keksic solve Anji's tree so that he can win her heart, and make her come to xc4 x8ca xc4 x8dak. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 5 cdot 10^4 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains a single integer n ( 2 <= n <= 3 cdot 10^5 ) -- the number of vertices in a tree. The second line of each test case contains a string s of n characters -- characters are written on the vertices. It is guaranteed that s consists only of characters 'U', 'L', and 'R'. The i -th of the next n lines contains two integers l_i and r_i ( 0 <= l_i, r_i <= n ) -- indices of left and right child of the vertex i . If l_i = 0 , it means that ve"...