#include<bits/stdc++.h>
#define double long double
#define int128 __int128
#define int long long
#define re register
#define in inline
#define Pi pair<int,int>
#define vi vector<int>
#define max(a,b)  ((a)>(b)?a:b)
#define min(a,b)  ((a)<(b)?a:b)
#define ls x<<1
#define rs x<<1|1
#define mid (l+r>>1)
#define dx x+xx[i]
#define dy y+yy[i]
#define debug cout<<"wuyu"<<endl;
using namespace std;
const int INF=0x3f3f3f3f3f;
const int N=5e5+19;
const int M=1e6+10;
const int mod=998244353;
const double eps=1e-5;
in int read(){	re int x=0,f=0;re char c=getchar();	while(!isdigit(c)) f|=(c=='-'),c=getchar();	while(isdigit(c))  x=(x<<3)+(x<<1)+c-'0',c=getchar();	return f?-x:x;}
in void write(re int x){	if(x<0) putchar('-'),x=-x;	if(x>9) write(x/10);	putchar(x%10+'0');}



struct edge{
	int u,v,w;
	int nx;
}e[M];
int tot,head[N];

in void add(re int u,re int v){
	e[++tot].u=u;
	e[tot].v=v;
	e[tot].nx=head[u];
	head[u]=tot;
}

int lg[N];
int fa[N][20];
int deep[N];

int lca(int x,int y){
	if(deep[x]<deep[y]) swap(x,y);\
	while(deep[x]>deep[y]){
		x=fa[x][lg[deep[x]-deep[y]]-1];
	}
	if(x==y) return x;
	for(int i=lg[deep[x]];i;i--){
		if(fa[x][i]!=fa[y][i]){
			x=fa[x][i];
			y=fa[y][i];
		}
	}
	
	return fa[x][0];
}

void dfs(int x,int f){
	deep[x]=deep[f]+1;
	fa[x][0]=f;
	for(int i=1;(1<<i)<=deep[x];i++){
		fa[x][i]=fa[fa[x][i-1]][i-1];
	}
	for(int i=head[x];i;i=e[i].nx){
		int v=e[i].v;
		if(v==f) continue;
		dfs(v,x);
	}
}

int n,m;
int ans;


signed main(){
	n=read();m=read();
	for(int i=1;i<n;i++){
		int u,v;
		u=read();v=read();
		add(u,v);add(v,u);
	}
	dfs(1,0);
	for(int i=1;i<=n;i++){
		lg[i]=lg[i>>1]+1;
	}
	
	for(int i=1;i<=m;i++){
		ans=0;
		int a,b,c;
		a=read();b=read();c=read();
		int x,y,z;
		x=lca(a,b);
		y=lca(a,c);
		z=lca(b,c);
		if(x==y){
			ans=z;
		}
		else if(x==z){
			ans=y;
		}
		else{
			ans=x;
		}
		int	dadada=deep[a]+deep[b]+deep[c]-deep[x]-deep[y]-deep[z];
		cout<<ans<<" "<<dadada<<endl;
	}
	return 0;
	
	
	
}