# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi 3.1415926535

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

# define mp make_pair

# define pb push_back

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

int Scan() {

    int res=, flag=;

    char ch;

    if((ch=getchar())=='-') flag=;

    else if(ch>=''&&ch<='') res=ch-'';

    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');

    return flag?-res:res;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

//Code begin...

struct Edge{int to, next;}edge[N<<];

int head[N], tot, fa[N][], deg[N];

queue<int>que;

void add_edge(int u, int v){edge[tot].to=v; edge[tot].next=head[u]; head[u]=tot++;}

void init(){tot=; mem(head,-);}

void BFS(int root){

    deg[root]=; fa[root][]=root; que.push(root);

    while (!que.empty()) {

        int tmp=que.front(); que.pop();

        FO(i,,) fa[tmp][i]=fa[fa[tmp][i-]][i-];

        for (int i=head[tmp]; i!=-; i=edge[i].next) {

            int v=edge[i].to;

            if (v==fa[tmp][]) continue;

            deg[v]=deg[tmp]+; fa[v][]=tmp; que.push(v);

        }

    }

}

int LCA(int u, int v){

    if (deg[u]>deg[v]) swap(u,v);

    int hu=deg[u], hv=deg[v], tu=u, tv=v;

    for (int det=hv-hu, i=; det; det>>=, i++) if (det&) tv=fa[tv][i];

    if (tu==tv) return tu;

    for (int i=; i>=; --i) {

        if (fa[tu][i]==fa[tv][i]) continue;

        tu=fa[tu][i]; tv=fa[tv][i];

    }

    return fa[tu][];

}

int main ()

{

    int n, m, u, v, w, x, y, tmp, p;

    init();

    n=Scan(); m=Scan();

    FO(i,,n) scanf("%d%d",&u,&v), add_edge(u,v), add_edge(v,u);

    BFS();

    while (m--) {

        int ans=INF;

        scanf("%d%d%d",&u,&v,&w);

        x=LCA(u,v); tmp=deg[u]+deg[v]-*deg[x];

        y=LCA(x,w); tmp+=(deg[x]+deg[w]-*deg[y]);

        if (ans>tmp) p=x, ans=tmp;

        x=LCA(u,w); tmp=deg[u]+deg[w]-*deg[x];

        y=LCA(x,v); tmp+=(deg[x]+deg[v]-*deg[y]);

        if (ans>tmp) p=x, ans=tmp;

        x=LCA(v,w); tmp=deg[v]+deg[w]-*deg[x];

        y=LCA(x,u); tmp+=(deg[x]+deg[u]-*deg[y]);

        if (ans>tmp) p=x, ans=tmp;

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

    }

    return ;

}