问题 H: To the Colors of the Dreams of Electric Sheep

You are visiting a colorful tree in the dream of Electric Sheep, which has at most $60$ colors. These colors are numbered from $0$ to $59$.
The colorful tree has $n$ vertices, connected with $n-1$ edges. Each vertex is painted in some of the colors. Let non-negative integer cic_ici denotes the colors of vertex $i$. If the lowest $j$-th bit of cic_ici is $1$, the colors that vertex $i$ is painted contains color $j$. Note that a vertex can be painted in no colors, which means this vertex is transparent.
You also have your own color $c$. When you are travelling on the colorful tree, you can visit vertex $i$ iff the colors of vertex $i$ contains your color $c$. If you are at vertex $u$ and your color is $c$, you can do one of the following operations in $1$ second:

• Move to vertex $v$ that is adjacent to vertex $u$.
  Note that both the colors of vertex $u$ and those of vertex $v$ should contain color $c$.
  
• Choose a color c′c'c′ and change your color to c′c'c′.
  Note that the colors of vertex $u$ should contain both color $c$ and c′c'c′.
  

Now you are planning for $q$ trips. The $i$-th trip is planned from vertex uiu_iui to another vertex viv_ivi. You can choose any color you want as your color $c$ at vertex uiu_iui before the trip. Find out the number of seconds that need to be taken to arrive at vertex viv_ivi in the optimal way for each trip.
If you can’t reach vertex viv_ivi from vertex uiu_iui, print $-1$.

10 8
12 9 14 5 1 18 18 9 14 7
1 3
2 3
2 4
3 6
4 10
5 8
7 9
8 9
8 10
1 7
3 8
4 5
5 6
6 1
8 10
9 2
10 5

10
5
3
8
3
1
5
2