Rune Forest

Black Bear and White Bear are a brother and sister pair of Komodo bears who live in Rune Forest. The two bears want to play a string game on a single tree in the forest. The tree in Rune Forest has vertices numbered 1 through $N$ and $N-1$ bidirectional edges, and it forms a connected graph. Vertex $i$ has an uppercase English letter $r_i$ written on it. The bears build strings on the tree with the following rules.

1. Start with an empty string $S$.
2. Choose vertices $x$ and $y$. They may be the same vertex.
3. Walk along the simple path (a path with no repeated vertices) that starts at $x$ and ends at $y$. Append the letters on the visited vertices to the right end of $S$, in the order they are visited. The letters on $x$ and $y$ are included.

The string built this way from $x$ and $y$ is written $S(x,y)$. The letters on the tree never disappear or change during the game.

Black Bear picks vertices $a$ and $b$ to build $S(a,b)$. White Bear picks vertices $c$ and $d$ to build $S(c,d)$. Then they compare the two strings from the left end and count how many characters match. This is the Komodo bears' string game.

The first line contains the number of vertices $N$. $(2\leq N\leq 2\times 10^5)$

From the second line, the next $N$ lines give the letter $r_i$ written on vertex $i$ on line $i+1$. Each $r_i$ is an uppercase English letter.

From line $N+2$, the next $N-1$ lines each contain the two endpoints $u_i$ and $v_i$ of an edge, separated by a space. $(1\leq u_i < v_i\leq N)$

Line $2N+1$ contains an integer $M$. $(1\leq M\leq 2\times 10^5)$

From line $2N+2$, the next $M$ lines each contain four vertices $a_i, b_i, c_i, d_i$ separated by spaces, chosen by Black Bear and White Bear. $(1\leq a_i,b_i,c_i,d_i\leq N)$

Print $M$ lines. On line $i$, print how many characters match when $S(a_i,b_i)$ and $S(c_i,d_i)$ are compared from the left end.