Let's define a non-oriented connected graph of n vertices and n - 1 edges as a beard , if all of its vertices except, perhaps, one, have the degree of 2 or 1 (that is, there exists no more than one vertex, whose degree is more than two). Let us remind you that the degree of a vertex is the number of edges that connect to it. Let each edge be either black or white. Initially all edges are black. You are given the description of the beard graph. Your task is to analyze requests of the following types: paint the edge number i black. The edge number i is the edge that has this number in the description. It is guaranteed that by the moment of this request the i -th edge is white paint the edge number i white. It is guaranteed that by the moment of this request the i -th edge is black find the length of the shortest path going only along the black edges between vertices a and b or indicate that no such path exists between them (a path's length is the number of edges in it) The vertices are numbered with integers from 1 to n , and the edges are numbered with integers from 1 to n - 1 . The first line of the input contains an integer n ( 2 ≤ n ≤ 10 5 ) — the number of vertices in the graph. Next n - 1 lines contain edges described as the numbers of vertices v i , u i ( 1 ≤ v i , u i ≤ n , v i ≠ u i ) connected by this edge. It is guaranteed that the given graph is connected and forms a beard graph, and has no self-loops or multiple edges. The next line contains an integer m ( 1 ≤ m ≤ 3·10 5 ) — the number of requests. Next m lines contain requests in the following form: first a line contains an integer type , which takes values from 1 to 3 , and represents the request type. If type = 1 , then the current request is a request to paint the edge black. In this case, in addition to number type the line should contain integer id ( 1 ≤ id ≤ n - 1 ), which represents the number of the edge to paint. If type = 2 , then the current request is a request to paint the edge whi