Problem: Sigma and Sugim are playing a game.

The game is played on a graph with N vertices numbered 1 through N. The graph has N-1 red edges and N-1 blue edges, and the N-1 edges in each color forms a tree. The red edges are represented by pairs of integers (a_i, b_i), and the blue edges are represented by pairs of integers (c_i, d_i).

Each player has his own piece. Initially, Sigma's piece is at vertex X, and Sugim's piece is at vertex Y.

The game is played in turns, where turns are numbered starting from turn 1. Sigma takes turns 1, 3, 5, ..., and Sugim takes turns 2, 4, 6, ....

In each turn, the current player either moves his piece, or does nothing. Here, Sigma can only move his piece to a vertex that is directly connected to the current vertex by a red edge. Similarly, Sugim can only move his piece to a vertex that is directly connected to the current vertex by a blue edge.

When the two pieces come to the same vertex, the game ends immediately. If the game ends just after the operation in turn i, let i be the total number of turns in the game.

Sigma's objective is to make the total number of turns as large as possible, while Sugim's objective is to make it as small as possible.

Determine whether the game will end in a finite number of turns, assuming both players plays optimally to achieve their respective objectives. If the answer is positive, find the number of turns in the game.

Constraints

* 2 ≦ N ≦ 200,000
* 1 ≦ X, Y ≦ N
* X \neq Y
* 1 ≦ a_i, b_i, c_i, d_i ≦ N
* The N-1 edges in each color (red and blue) forms a tree.

Input

The input is given from Standard Input in the following format:


N X Y
a_1 b_1
a_2 b_2
:
a_{N-1} b_{N-1}
c_1 d_1
c_2 d_2
:
c_{N-1} d_{N-1}


Output

If the game will end in a finite number of turns, print the number of turns. Otherwise, print `-1`.

Examples

Input

4 1 2
1 2
1 3
1 4
2 1
2 3
1 4


Output

4


Input

3 3 1
1 2
2 3
1 2
2 3


Output

4


Input

4 1 2
1 2
3 4
2 4
1 2
3 4
1 3


Output

2


Input

4 2 1
1 2
3 4
2 4
1 2
3 4
1 3


Output

-1


Input

5 1 2
1 2
1 3
1 4
4 5
2 1
1 3
1 5
5 4


Output

6

Solution (in CPP):

Solution:
#include <bits/stdc++.h>

#define pb(n) push_back(n)
#define maxn 200010
#define inf 1000000000

using namespace std;

bool czy [maxn], special [maxn], czy1[maxn];
int bdistance [maxn], ojciec[maxn], ile[maxn];
vector<int> red[maxn], blue[maxn];

int Find (int x)
{
	if (ojciec[x]!=x)
		ojciec[x]=Find(ojciec[x]);
	return ojciec[x];
}

void join (int a, int b)
{
	a = Find(a);
	b = Find(b);
	if (a != b)
	{
		ojciec[a]=b;
		ile[b] += ile[a];
	}
}

void calculate_blue (int x)
{
	czy[x]=true;
	int s = (int)blue[x].size();
	for (int i = 0; i<s; ++i)
	{
		if(!czy[blue[x][i]])
		{
			bdistance[blue[x][i]] = bdistance[x] + 1;
			calculate_blue(blue[x][i]);
		}
	}
	czy[x]=false;
}

void calculate_special (int x, int y)
{
	//cout << "S" << x << endl;
	czy[x]=true;
	int s = (int)red[x].size();
	for(int i=0; i<s; ++i)
	{
		if (czy[red[x][i]])
		{
			int odl = bdistance[x] + bdistance[red[x][i]] - 2 * bdistance[Find(red[x][i])];
			//cout << Find(red[x][i]) << endl;
			//cout << x << " " << red[x][i] << " " << odl << endl;
			if (odl >= 3)
				special[x] = special[red[x][i]] = true;
		}
	}
	s = (int) blue[x].size();
	for (int i = 0; i<s; ++i)
	{
		if(!czy[blue[x][i]])
			calculate_special (blue[x][i], x);
	}
	join (x, y);
}

int answer (int x, int y)
{
	czy1 [x] = true;
	if (special[x] && bdistance [x] > y)
		return inf;
	if (bdistance [x] <= y)
		return y;
	int odp = bdistance [x];
	int s = (int)red[x].size();
	for (int i = 0; i<s; ++i)
	{
		if (!czy1[red[x][i]])
		{
			odp = max(answer (red[x][i], y + 1), odp);
		}
	}
	return odp;	
}


int main()
{
	int n, x, y,a,b;
	cin >> n >> x >> y;
	for(int i=1; i<n; ++i)
	{
		cin >> a >> b;
		red[a].pb(b);
		red[b].pb(a);
		ojciec[i]=i;
		ile[i]=1;
	}
	ojciec[n]=n;
	ile[n]=1;
	for(int i=1; i<n; ++i)
	{
		cin >> a >> b;
		blue[a].pb(b);
		blue[b].pb(a);
	}
	calculate_blue (y);
	calculate_special (y, y);
	int ans = answer (x, 0);
	if (ans == inf)
		puts ("-1");
	else
		cout << 2 * ans << endl;
	return 0;
}