#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define pb emplace_back
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using pii = pair <int, int>;

const int N = 1e5 + 10;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int n, q, p[N], dep[N], fp[N][20], ans[N], m;
vector <int> e[N];
vector <pii> qry[N];

struct node {
  int d, u;
  node(int _d = 0, int _u = 0) {
    d = _d, u = _u;
  }
  friend node operator + (node a, int b) {
    return node(a.d + b, a.u);
  }
  friend bool operator < (node a, node b) {
    return a.d == b.d ? a.u < b.u : a.d < b.d;
  }
  friend bool operator == (node a, node b) {
    return a.d == b.d && a.u == b.u;
  }
} up[N], down[N], a[N], mx[N], se[N];

void dfs0(int u, int fa) {
  p[u] = fa;
  for (int v : e[u]) if (v != fa) {
    dep[v] = dep[u] + 1, dfs0(v, u), down[u] = max(down[u], down[v] + 1);
  }
}

void dfs1(int u, int fa) {
  node x, y;
  auto upd = [&](node d) {
    if (x < d) y = x, x = d;
    else if (y < d) y = d;
  } ;
  for (int v : e[u]) if (v != fa) upd(down[v] + 1);
  for (int v : e[u]) if (v != fa) {
    up[v] = up[u] + 1;
    if (down[v] + 1 == x) up[v] = max(up[v], y + 1);
    else up[v] = max(up[v], x + 1);
    dfs1(v, u);
  }
}

int main() {
  n = read(), q = read();
  rep(i, 1, n - 1) {
    int u = read(), v = read();
    e[u].pb(v), e[v].pb(u);
  }
  rep(i, 1, q) {
    int u = read(), d = read();
    qry[u].pb(mp(d, i));
  }
  rep(i, 1, n) down[i] = up[i] = node(0, i);
  dfs0(1, 0), dfs1(1, 0);
  rep(u, 1, n) fp[u][0] = p[u];
  rep(i, 1, 19) rep(u, 1, n) fp[u][i] = fp[fp[u][i - 1]][i - 1];
  auto anc = [&](int u, int k) {
    drep(i, 19, 0) if (k >> i & 1) u = fp[u][i];
    return u;
  } ;
  auto LCA = [&](int u, int v) {
    if (dep[u] < dep[v]) swap(u, v);
    drep(i, 19, 0) if (dep[u] - dep[v] >> i & 1) u = fp[u][i];
    if (u == v) return u;
    drep(i, 19, 0) if (fp[u][i] != fp[v][i]) u = fp[u][i], v = fp[v][i];
    return fp[u][0];
  } ;
  auto kth = [&](int u, int v, int k) {
    int lca = LCA(u, v), dis = dep[u] + dep[v] - 2 * dep[lca];
    if (dep[u] - dep[lca] >= k) return anc(u, k);
    else return anc(v, dis - k);
  } ;
  rep(u, 1, n) {
    m = 0;
    for (int v : e[u]) a[++ m] = (p[v] == u ? down[v] : up[v]) + 1;
    sort(a + 1, a + m + 1), mx[u] = a[m], se[u] = a[m - 1];
  }
  rep(u, 1, n) if (qry[u].size()) {
    m = 0;
    for (int v : e[u]) a[++ m] = (p[v] == u ? down[v] : up[v]) + 1;
    sort(a + 1, a + m + 1);
    for (auto [d, id] : qry[u]) {
      int deg = m - (lower_bound(a + 1, a + m + 1, node(d, 0)) - a - 1);
      if (d <= 2 * (deg - 1)) ans[id] = d;
      else {
        // cout << "d, u = " << a[m].d << ' ' << a[m].u << endl;
        int res = d + a[m].d, t = (d - 2 * (deg - 1) - 1) / 2, v = kth(u, a[m].u, t);
        // cout << "t, v = " << t << ' ' << v << endl;
        // pv(mx[v].d);
        // pv(se[v].d);
        if (v == u) res = min(res, d + a[m - 1].d);
        else {
          if (mx[v].d == d - t) res = min(res, d - t + se[v].d);
          else res = min(res, d - t + mx[v].d);
        }
        ans[id] = res;
      }
    }
  }
  rep(i, 1, q) printf("%d\n", ans[i]);
  return 0;
}