int find (int x, int y) {
	while (top[x] != top[y]) {
		y = top[y];//这行千万不能写成y = fa[top[y]]
		if (fa[y] == x)
			return y;
		y = fa[y];
	}
	return son[x];
}