// bzoj3572#include<algorithm>#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<set>#define MOD 1000000007#define inf 2147483640#define LL long long#define free(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout);using namespace std;inline LL getint() {    LL x=0,f=1;char ch=getchar();    while (ch>‘9‘ || ch<‘0‘) {if (ch==‘-‘) f=-1;ch=getchar();}    while (ch>=‘0‘ && ch<=‘9‘) {x=x*10+ch-‘0‘;ch=getchar();}    return x*f;}const int maxn=300010;struct edge {int next,to;}e[maxn<<2];int a[maxn],f[maxn],bel[maxn],fa[maxn][20],bin[20],size[maxn],dfn[maxn],s[maxn],head[maxn],deep[maxn],b[maxn],c[maxn],rem[maxn];int n,top,cnt;void insert(int u,int v) {    e[++cnt].to=v;e[cnt].next=head[u];head[u]=cnt;}bool cmp(int x,int y) {    return dfn[x]<dfn[y];}void dfs(int u) {    dfn[u]=++cnt;size[u]=1;    for (int i=1;bin[i]<=deep[u];i++) fa[u][i]=fa[fa[u][i-1]][i-1];    for (int i=head[u];i;i=e[i].next) if (e[i].to!=fa[u][0]) {            fa[e[i].to][0]=u;            deep[e[i].to]=deep[u]+1;            dfs(e[i].to);            size[u]+=size[e[i].to];        }}int lca(int x,int y) {    if (deep[x]<deep[y]) swap(x,y);    int t=deep[x]-deep[y];    for (int i=0;bin[i]<=t;i++) if (t&bin[i]) x=fa[x][i];    for (int i=19;i>=0;i--) if (fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];    return x==y?x:fa[x][0];}int dis(int x,int y) {    return deep[x]+deep[y]-2*deep[lca(x,y)];}void build(int K) {    top=cnt=0;    sort(a+1,a+1+K,cmp);    if (bel[1]!=1) s[++top]=1;    for (int i=1;i<=K;i++) {        int t=a[i],f=0;        while (top>0) {            f=lca(t,s[top]);            if (top>1 && deep[f]<deep[s[top-1]]) {                insert(s[top-1],s[top]);top--;            }            else if (deep[f]<deep[s[top]]) {                insert(f,s[top--]);break;            }            else break;        }        if (s[top]!=f) s[++top]=f;        s[++top]=t;    }    while (--top) insert(s[top],s[top+1]);}void dfs1(int u) {    c[++cnt]=u;rem[u]=size[u];    for (int i=head[u];i;i=e[i].next) {        dfs1(e[i].to);        if (!bel[e[i].to]) continue;        int t1=dis(bel[e[i].to],u),t2=dis(bel[u],u);        if ((t1==t2 && bel[e[i].to]<bel[u]) || t1<t2 || !bel[u])            bel[u]=bel[e[i].to];    }}void dfs2(int u) {    for (int i=head[u];i;i=e[i].next) {        int t1=dis(bel[u],e[i].to),t2=dis(bel[e[i].to],e[i].to);        if ((t1==t2 && bel[e[i].to]>bel[u]) || t1<t2 || !bel[e[i].to])            bel[e[i].to]=bel[u];        dfs2(e[i].to);    }}void solve(int a,int b) {    int x=b,mid=b;    for (int i=18;i>=0;i--)        if (deep[fa[x][i]]>deep[a]) x=fa[x][i];    rem[a]-=size[x];    if (bel[a]==bel[b]) {        f[bel[a]]+=size[x]-size[b];        return;    }    for (int i=18;i>=0;i--) {        int nxt=fa[mid][i];        if (deep[nxt]<=deep[a]) continue;        int t1=dis(bel[a],nxt),t2=dis(bel[b],nxt);        if (t1>t2 || (t1==t2 && bel[b]<bel[a])) mid=nxt;    }    f[bel[a]]+=size[x]-size[mid];    f[bel[b]]+=size[mid]-size[b];}int main() {    bin[0]=1;for (int i=1;i<20;i++) bin[i]=bin[i-1]<<1;    scanf("%d",&n);    for (int i=1;i<n;i++) {        int u=getint(),v=getint();        insert(u,v);insert(v,u);    }    cnt=0;dfs(1);    memset(head,0,sizeof(head));    int q;scanf("%d",&q);    while (q--) {        int K;scanf("%d",&K);        for (int i=1;i<=K;i++) scanf("%d",&a[i]);        for (int i=1;i<=K;i++) bel[b[i]=a[i]]=a[i];        build(K);cnt=0;        dfs1(1);dfs2(1);        for (int i=1;i<=cnt;i++)            for (int j=head[c[i]];j;j=e[j].next) solve(c[i],e[j].to);        for (int i=1;i<=cnt;i++) f[bel[c[i]]]+=rem[c[i]];        for (int i=1;i<=K;i++) printf("%d ",f[b[i]]);        printf("\n");        for (int i=1;i<=cnt;i++) f[c[i]]=bel[c[i]]=head[c[i]]=rem[c[i]]=0;    }    return 0;}