Codeforces Round #339 (Div. 1) D - Kingdom and its Cities （虚树优化树形dp）

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define fi first
#define se second
#define pb  push_back
#define inf 1e18
#define endl '\n'
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define de_bug(x) cerr << #x << "=" << x << endl
#define all(a) a.begin(),a.end()
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--)
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
int n, k;
vector<int>g[N];
int f[N], tot, son[N], h[N], e[N], ne[N], idx,  d[N], cnt, siz[N];
int ss[N], top[N], dfn[N], num[N] , t, stk[N], q , a[N], id, vis[N];
set<int>s;
void add(int a, int b) {
	e[cnt] = b,  ne[cnt] = h[a], h[a] = cnt++;
}
void dfs(int u, int fa) {
	d[u] = d[fa] + 1;
	f[u] = fa;
	dfn[u] = ++tot;
	siz[u] = 1;
	int ma = -1;
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(v == fa)continue;
		dfs(v, u);
		siz[u] += siz[v];
		if(ma < siz[v]) {
			son[u] = v, ma = siz[v];
		}
	}
}
void dfs2(int u, int ff) {
	top[u] = ff;
	if(!son[u])return;
	dfs2(son[u], ff);
	for(int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if(v != f[u] && v != son[u])dfs2(v, v);
	}
}
int lca(int x, int y) {
	while(top[x] != top[y]) {
		if(d[top[x]] < d[top[y]])swap(x, y);
		x = f[top[x]];
	}
	return d[x] < d[y] ? x : y;
}
void  sol(int x, int y) {
	g[x].push_back(y);
//	ss[++id] = x;
//	ss[++id] = y;
    s.insert(x),s.insert(y);
}
int ans;
void dfs3(int u) {
	int cnt = 0, sum = 0;
	for(auto v : g[u]) {
		dfs3(v);
		if(num[u] && num[v])ans++;
		if(!num[u] && num[v]) {
			cnt++;
			sum += num[v];
		}
	}
	if(!num[u]) {
		if(cnt == 1)num[u] += sum;
		if(cnt > 1)ans++;
	}
	g[u].clear();
}
void  build(int x) {
	if(x == 1)return ;
	if(t == 1) {
		stk[++t] = x;
		return ;
	}
	int tmp = lca(stk[t], x);
	if(tmp == stk[t]) {
		stk[++t] = x;
		return ;
	}
	while(t > 1 && dfn[tmp] <= dfn[stk[t - 1]]) {
		sol(stk[t - 1], stk[t]);
		//ss[++id]=stk[t-1];
		t--;
		ss[++id]=stk[t];
	}
	while(tmp != stk[t]) {
		sol(tmp, stk[t]);
	//	ss[++id] = tmp;
		stk[t] = tmp;
	}
	stk[++t] = x;
	return ;
}
bool cmp(int x, int y) {
	return dfn[x] < dfn[y];
}
void solve() {
	cin >> n;
	memset(h, -1, sizeof(h));
	fer(i, 1, n - 1) {
		int a, b;
		cin >> a >> b ;
		add(a, b);
		add(b, a);
	}
	dfs(1, 0);
	dfs2(1, 1);
	cin >> q;
	int fff = 0;
	while(q--) {
		id = 0;
		ans = 0;
		s.clear();
		stk[t = 1] = 1;
		fff = 0;

		int x;
		cin >> x;
		fer(i, 1, x)cin >> a[i], num[a[i]] = 1;
		fer(i, 1, x) {
			if(num[f[a[i]]]) {
				fff = 1;
				cout << -1 << endl;
				break;
			}
		}
		if(fff) {
			fer(i, 1, x) num[a[i]] = 0;
			continue;
		}
		sort(a + 1, a + x + 1, cmp);
		fer(i, 1, x) build(a[i]);
		while(t) sol(stk[t - 1], stk[t]), t--;//ss[++id]=stk[t];
		dfs3(1);
		for(int i = 1; i <= x; i++)  num[a[i]] = 0;
	//	de_bug(id);
	//	for(int i = 1; i <= id; i++)   num[ss[i]] = 0;
		//for(int i = 1; i <= id; i++)
		//	g[ss[i]].clear();
	//	cout<<endl;
		for(auto v:s)num[v]=0;
		cout << ans << endl;
	}
}
signed main() {
	IOS;
	int _ = 1;
	//cin>>_;
	while( _-- )
		solve();
}