1
#include<bits/stdc++.h>
2
const int N = 5e5 + 10;
3
using namespace std;
4
int n, m;
5
int read()
6
{
7
  int f = 1, x = 0;
8
  char ch = getchar();
9
  while(ch < '0' || ch > '9')
10
  {
11
    if(ch == '-') f = -1;
12
    ch = getchar();
13
  }
14

15
  while(ch >= '0' && ch <= '9')
16
  {
17
    x = x * 10 + ch - '0';
18
    ch = getchar();
19
  }
20
  return f * x;
21
}
22

23
int head[N], nxt[N << 1], to[N << 1], cnt = 1;
24
int fa[N][20];
25
int depth[N];
26
void add(int x, int y)
27
{
28
  to[++cnt] = y;
29
  nxt[cnt] = head[x];
30
  head[x] = cnt;
31
}
32

33
void dfs(int u, int fath)
34
{
35
  fa[u][0] = fath;
36
  depth[u] = depth[fath] + 1;
37
  for(int i = head[u]; i; i = nxt[i])
38
  {
39
    int v = to[i];
40
    if(v == fath) continue;
41
    dfs(v, u);
42
  }
43
}
44

45
void initlca()
46
{
47
  for(int j = 1;j < 20;j++)
48
  {
49
    for(int i = 1;i <= n;i++)
50
    {
51
      fa[i][j] = fa[fa[i][j - 1]][j - 1];
52
    }
53
  }
54
}
55

56
int querylca(int x, int y)
57
{
58
  if(depth[x] < depth[y]) swap(x, y);
59

60
  for(int j = 19;j >= 0;j--)
61
  {
62
    if(depth[fa[x][j]] >= depth[y])
63
    {
64
      x = fa[x][j];
65
    }
66
  }
67

68
  if(x == y) return x;
69

70
  for(int j = 19;j >= 0;j--)
71
  {
72
    if(fa[x][j] != fa[y][j])
73
    {
74
      x = fa[x][j], y = fa[y][j];
75
    }
76
  }
77

78
  return fa[x][0];
79
}
80

81
int main()
82
{
83
  n = read(), m = read();
84
  int a, b;
85
  for(int i = 1;i <= n - 1;i++)
86
  {
87
    a = read(), b = read();
88
    add(a, b), add(b, a);
89
  }
90
  dfs(1, 0);
91
  initlca();
92
  int x, y, z;
93
  while(m --)
94
  {
95
    x = read(), y = read(), z = read();
96
    int xy = querylca(x, y);
97
    int yz = querylca(y, z);
98
    int xz = querylca(x, z);
99
    int xyz = querylca(xy, z);
100
    int yzx = querylca(yz, x);
101
    int xzy = querylca(xz, y);
102
    int xy_long = (-2) * depth[xy] + depth[x] + depth[y] - 2 * depth[xyz] + depth[z] + depth[xy];
103
    int yz_long = (-2) * depth[yz] + depth[y] + depth[z] - 2 * depth[yzx] + depth[x] + depth[yz];
104
    int xz_long = (-2) * depth[xz] + depth[x] + depth[z] - 2 * depth[xzy] + depth[y] + depth[xz];
105

106
    if(xy_long <= yz_long && xy_long <= xz_long)
107
    {
108
      printf("%d %d\n", xy, xy_long);
109
    }
110
    else if(yz_long <= xy_long && yz_long <= xz_long)
111
    {
112
      printf("%d %d\n", yz, yz_long);
113
    }
114
    else if(xz_long <= xy_long && xz_long <= yz_long)
115
    {
116
      printf("%d %d\n", xz, xz_long);
117
    }
118

119
  }
120
  return 0;
121
}