/**************************************************************

     Problem: 3611

     User: Tunix

     Language: C++

     Result: Accepted

     Time:7460 ms

     Memory:181024 kb

 ****************************************************************/

 //BZOJ 3611

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 using namespace std;

 int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')sign=-;ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*=sign;

 }

 /******************tamplate*********************/

 const int N=,INF=~0u>>;

 typedef long long LL;

 int n,m,dfn[N],dfs_clock,dep[N],fa[N][],a[N];

 LL ans,g[N];

 int f[N],_min[N],_max[N],ans1,ans2;

 bool v[N];

 inline int LCA(int x,int y){

     if(dep[x]<dep[y]) swap(x,y);

     int t=dep[x]-dep[y];

     F(i,,) if(t&(<<i)) x=fa[x][i];

     if (x==y) return x;

     D(i,,) if(fa[x][i]!=fa[y][i]) x=fa[x][i],y=fa[y][i];

     return fa[x][];

 }

 struct graph{

     int head[N],to[N<<],next[N<<],len[N<<],cnt;

     void add(int x,int y){

         to[++cnt]=y; next[cnt]=head[x]; head[x]=cnt;

         to[++cnt]=x; next[cnt]=head[y]; head[y]=cnt;

     }

     void ad(int x,int y){

         to[++cnt]=y; next[cnt]=head[x]; head[x]=cnt; len[cnt]=dep[y]-dep[x];

     }

     void dfs(int x){

         dfn[x]=++dfs_clock;

         F(i,,) if(dep[x]>=(<<i)) fa[x][i]=fa[fa[x][i-]][i-]; else break;

         for(int i=head[x];i;i=next[i])

             if(to[i]!=fa[x][]){

                 fa[to[i]][]=x;

                 dep[to[i]]=dep[x]+;

                 dfs(to[i]);

             }

     }

     void DP(int x){

         f[x]=v[x]; g[x]=;

         _min[x]=v[x] ?  : INF;

         _max[x]=v[x] ?  : -INF;

         for(int i=head[x];i;i=next[i]){

             int y=to[i];

             DP(y);

             ans+=(g[x]+f[x]*len[i])*f[y]+g[y]*f[x];

             f[x]+=f[y];

             g[x]+=g[y]+(LL)len[i]*f[y];

             ans1=min(ans1,_min[x]+_min[y]+len[i]);

             ans2=max(ans2,_max[x]+_max[y]+len[i]);

             _min[x]=min(_min[x],_min[y]+len[i]);

             _max[x]=max(_max[x],_max[y]+len[i]);

         }

         head[x]=;

     }

 }G1,G2;

 inline bool cmp(int a,int b){ return dfn[a]<dfn[b]; }

 int st[N],top;

 int main(){

 //  freopen("3611.in","r",stdin);

     n=getint();

     int x,y;

     F(i,,n){

         x=getint(); y=getint();

         G1.add(x,y);

     }

     G1.dfs();

     int T=getint();

     while(T--){

         m=getint();

         F(i,,m) {a[i]=getint(); v[a[i]]=;}

         sort(a+,a+m+,cmp);

         st[top=]=; G2.cnt=;

         ans=; ans1=INF; ans2=-INF;

         F(i,,m){

             int x=a[i],f=LCA(x,st[top]);

             while(dep[f]<dep[st[top]]){

                 if(dep[f]>=dep[st[top-]]){

                     G2.ad(f,st[top--]);

                     if(st[top]!=f) st[++top]=f;

                     break;

                 }

                 G2.ad(st[top-],st[top]); top--;

             }

             if(st[top]!=x) st[++top]=x;

         }

         while(--top) G2.ad(st[top],st[top+]);

         G2.DP();

         printf("%lld %d %d\n",ans,ans1,ans2);

         F(i,,m) v[a[i]]=;

     }

     return ;

 }