#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << "\n";
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
#include <experimental/iterator>
void orange_(auto s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  using namespace experimental;
  copy(L, R, make_ostream_joiner(cerr, ", "));
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

constexpr int N = 200000 + 5;
constexpr int K = 20;

vector<int> g[N];

int dep[N];
int tl[N], tr[N], tc;

int pa[N][K];

bool anc(int u, int v) {
  return tl[u] <= tl[v] and tr[v] <= tr[u];
}

int lca(int u, int v) {
  if (anc(u, v))
    return u;
  for (int i = K - 1; i >= 0; --i)
    if (not anc(pa[u][i], v))
      u = pa[u][i];
  return u;
}

void dfs(int u, int f) {
  pa[u][0] = f;
  for (int i = 1; i < K; ++i)
    pa[u][i] = pa[pa[u][i - 1]][i - 1];
  tl[u] = tc++;
  dep[u] = dep[f] + 1;
  for (int v : g[u]) {
    if (v != f)
      dfs(v, u);
  }
  tr[u] = tc;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, q;
  cin >> n >> q;
  for (int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(0, 0);
  while (q--) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    int64_t d = dep[u] + dep[v] - 2 * dep[lca(u, v)];
    int64_t ans = n;
    ans += d * (d + 1) / 2;
    cout << ans << '\n';
  }
  return 0;
}