#include <algorithm>

 #include <cstdio>

 #include <vector>

 using namespace std;

 const int N(1e5*+);

 vector<int>vec[N];

 int n,m,x,y,z;

 int anspoint,anssum;

 int deep[N],dad[N],size[N],top[N];

 void DFS(int x)

 {

     size[x]=; deep[x]=deep[dad[x]]+;

     for(int i=;i<vec[x].size();i++)

         if(dad[x]!=vec[x][i])

         {

             dad[vec[x][i]]=x;

             DFS(vec[x][i]);

             size[x]+=size[vec[x][i]];

         }

 }

 void DFS_(int x)

 {

     int t=; if(!top[x]) top[x]=x;

     for(int i=;i<vec[x].size();i++)

         if(vec[x][i]!=dad[x]&&size[t]<size[vec[x][i]]) t=vec[x][i];

     if(t) top[t]=top[x],DFS_(t);

     for(int i=;i<vec[x].size();i++)

         if(vec[x][i]!=dad[x]&&t!=vec[x][i]) DFS_(vec[x][i]);

 }

 int LCA(int x,int y)

 {

     while(top[x]!=top[y])

     {

         if(deep[top[x]]<deep[top[y]]) swap(x,y);

         x=dad[top[x]];

     }

     if(deep[x]>deep[y]) swap(x,y);

     return x;

 }

 int main()

 {

     scanf("%d%d",&n,&m);

     for(int i=;i<n;i++)

     {

         scanf("%d%d",&x,&y);

         vec[x].push_back(y);

         vec[y].push_back(x);

     }

     DFS(); DFS_();

     for(;m;m--)

     {

         scanf("%d%d%d",&x,&y,&z);

         anspoint=LCA(x,y)^LCA(x,z)^LCA(y,z);

         anssum =deep[x]+deep[anspoint]-(deep[LCA(x,anspoint)]<<);

         anssum+=deep[y]+deep[anspoint]-(deep[LCA(y,anspoint)]<<);

         anssum+=deep[z]+deep[anspoint]-(deep[LCA(z,anspoint)]<<);

         printf("%d %d\n",anspoint,anssum);

     }

     return ;

 }