当你Wa 0pt

int solve(int x) {
	if (x == 1) return posval[1];
	int ans = 0;
//	cout << x << '\n';
	
	while (x != 1) {
//		cout << "nailong" << id[top[x]] << ' ' << id[x] << '\n';
		ans += query(id[top[x]], id[x], 1);
//		cout << "nailong" << ans;
		x = fa[top[x]];
	}
	
	return ans;
}

int solve(int x, int y) {
	int ans = 0;
	while (top[x] != top[y]) {
		if (dep[top[x]] < dep[top[y]]) swap(x, y);
		ans += query(id[top[x]], id[x], 1);
		x = fa[top[x]];
	}
	if (dep[x] > dep[y]) swap(x, y);
	return ans += query(id[x], id[y], 1);
}