#include<bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
using namespace std;
const int N=5e5+5;
const int INF=0x3f3f3f3f;
const double EPS=10e-6;
ll dfn[N],dep[N],sz[N],top[N],fa[N],son[N],n,m,ans;
vector<int>g[N];
void dfs1(int u,int fath) {
	dep[u]=dep[fath]+1;
	fa[u]=fath;
	sz[u]=1;
	for(auto &v:g[u]){
		if(v==fath)continue;
		dfs1(v,u);
		sz[u]+=sz[v];
		if(sz[son[u]]<sz[v])son[u]=v;
	}
}
int ts=0;
void dfs2(int u,int t) {
	dfn[u]=++ts;
	top[u]=t;
	if(!son[u])return;
	dfs2(son[u],t);
	for(auto &v:g[u]){
		if(v==fa[u]||v==son[u])continue;
		dfs2(v,v);
	}
}
int LCA(int u,int v) {
	while(top[u]!=top[v]){
		if(dep[top[u]]<dep[top[v]])v=fa[top[v]];
		else u=fa[top[u]];
	}
	if(dep[u]<dep[v])return u;
	else return v;
}
ll LCA_Val(int a,int b,int c) {
	int lca1=LCA(a,b),lca2=LCA(a,c),lca3=LCA(b,c);
	if(lca1==lca2&&lca2==lca3){
		ans=lca1;
		return dep[a]-dep[lca1]+dep[b]-dep[lca1]+dep[c]-dep[lca1];
	}if(lca1==lca2&&lca1!=lca3){
		ans=lca3;
		return dep[a]-dep[lca3]+dep[b]-dep[lca1]+dep[c]-dep[lca3]+dep[lca3]-dep[lca1];
	}if(lca3==lca2&&lca1!=lca2){
		ans=lca1;
		return dep[a]-dep[lca1]+dep[b]-dep[lca1]+dep[c]-dep[lca3]+dep[lca1]-dep[lca2];
	}if(lca1==lca3&&lca3!=lca2){
		ans=lca2;
		return dep[a]-dep[lca3]+dep[b]-dep[lca2]+dep[c]-dep[lca2]+dep[lca2]-dep[lca3];
	}
}
void solve(){
	cin>>n>>m;
	for(int i=1;i<n;i++){
		int u,v;
		cin>>u>>v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs1(1,0);
	dfs2(1,1);
	while(m--){
		int a,b,c;
		cin>>a>>b>>c;
		ans=0;
		cout<<ans<<" "<<LCA_Val(a,b,c)<<endl;
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--)solve();
	return 0;
}