#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=1e5+5;
int n, q, deg[N];
vector<int> adj[N];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
for(int i=1; i<n; i++){
int u, v;
cin >> u >> v;
adj[u].emplace_back(v);
adj[v].emplace_back(u);
deg[u]++;
deg[v]++;
}
int __=1;
while(__++<=q){
multiset<int> ms;
ms.emplace(1);
ms.emplace(n);
int d;
cin >> d;
for(int i=1; i<=d; i++){
int x;
cin >> x;
ms.emplace(x);
}
vector<int> num(ms.begin(),ms.end());
int sz=num.size();
if(sz%2){
cout << -1 << "\n";
continue;
}
int ans=0;
for(int i=0; i<sz/2; i++){
ans+=num[sz/2+i]+(num[sz/2+i]!=n)-num[i]+(num[i]!=1);
}
cout << ans << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |