#include <cstdio>

#include <cstring>

#include <algorithm>

#define N 500010

#define p E[i].x

using namespace std;

struct edge{

    int x,to;

}E[N<<];

int n,m,totE,g[N],fa[N][],d[N];

inline void addedge(int x,int y){

    E[++totE]=(edge){y,g[x]}; g[x]=totE;

}

void dfs(int x){

    for(int i=;fa[x][i-]&&i<=;i++)

        fa[x][i]=fa[fa[x][i-]][i-];

    for(int i=g[x];i;i=E[i].to)

        if(p!=fa[x][]){

            fa[p][]=x;

            d[p]=d[x]+;

            dfs(p);

        }

}

int lca(int x,int y){

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

    for(int i=;~i;i--)

        if(d[fa[x][i]]>=d[y]) x=fa[x][i];

    if(x==y) return x;

    for(int i=;~i;i--)

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

    return fa[x][];

}

int dist(int a,int b){

    return d[a]+d[b]-*d[lca(a,b)];

}

void ask(int a,int b,int c){

    int f1=lca(a,b),f2=lca(a,c),f3=lca(b,c),ans,ansv;

    if(f1==f2) ans=f3;

    else if(f2==f3) ans=f1;

    else ans=f2;

    ansv=dist(a,ans)+dist(b,ans)+dist(c,ans);

    printf("%d %d\n",ans,ansv);

}

int main(){

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

    for(int i=,x,y;i<n;i++){

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

        addedge(x,y);

        addedge(y,x);

    }

    d[]=;

    dfs();

    for(int i=,x,y,z;i<=m;i++){

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

        ask(x,y,z);

    }

    return ;

}