#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 50005

vector<int> adj[N];
pair<int, int> a[2];
int n, m, fa[N], dep[N], siz[N], top[N], son[N], dfn[N], tim[N], tot1;
int uni[N];
int find(int x)
{
    if (x == uni[x])
        return x;
    else
        return uni[x] = find(uni[x]);
}
void dfs1(int f, int cur)
{
    fa[cur] = f;
    dep[cur] = dep[f] + 1;
    siz[cur] = 1;
    int mx = -1;
    for (const auto i : adj[cur])
    {
        if (i != f)
        {
            dfs1(cur, i);
            siz[cur] += siz[i];
            if (siz[i] > mx)
            {
                mx = siz[i];
                son[cur] = i;
            }
        }
    }
}
void dfs2(int t, int cur)
{
    top[cur] = t;
    dfn[cur] = ++tot1;
    tim[tot1] = cur;
    if (son[cur])
        dfs2(t, son[cur]);
    for (const auto i : adj[cur])
    {
        if (i != fa[cur] && i != son[cur])
        {
            dfs2(i, i);
        }
    }
}
int lca(int x, int y)
{
    while (top[x] != top[y])
    {
        if (dep[top[x]] < dep[top[y]])
            swap(x, y);
        x = fa[top[x]];
    }
    if (dep[x] < dep[y])
        swap(x, y);
    return y;
}

int k, p[N], tot2, dis[N], sta[N], tp;
void solve(int u, int v)
{
    sort(p + 1, p + k + 1, [](int a, int b)
         { return dfn[a] < dfn[b]; });
    tot2 = 0;
    sta[tp = 1] = 1;
    map<int, set<int>> adj;
    adj[a[0].first].insert(a[0].second);
    adj[a[1].first].insert(a[1].second);
    adj[a[0].second].insert(a[0].first);
    adj[a[1].second].insert(a[1].first);
    set<int> points;
    points.insert(1);
    for (int i = 1; i <= k; i++)
        points.insert(p[i]);
    for (int i = 1; i <= k; i++)
    {
        int f = lca(p[i], sta[tp]);
        points.insert(f);
        if (f != sta[tp])
        {
            while (dfn[f] < dfn[sta[tp - 1]])
            {
                adj[sta[tp - 1]].insert(sta[tp]);
                adj[sta[tp]].insert(sta[tp - 1]);
                tp--;
            }
            if (dfn[f] > dfn[sta[tp - 1]])
            {
                adj[f].insert(sta[tp]);
                adj[sta[tp]].insert(f);
                sta[tp] = f;
            }
            else
            {
                adj[f].insert(sta[tp]);
                adj[sta[tp]].insert(f);
                tp--;
            }
        }
        if (sta[tp] != p[i])
            sta[++tp] = p[i];
    }
    for (int i = 1; i < tp; i++)
    {
        adj[sta[i + 1]].insert(sta[i]);
        adj[sta[i]].insert(sta[i + 1]);
    }
    int ans = 0;
    for (int i : points)
    {
        dis[i] = 0;
        adj[i].erase(i);
    }
    function<void(int)> dfs = [&](int cur) -> void
    {
        if (cur == v)
        {
            ans++;
            return;
        }
        for (int i : adj[cur])
        {
            if (!dis[i])
            {
                dis[i] = 1;
                dfs(i);
                dis[i] = 0;
            }
        }
    };
    dis[u] = 1;
    dfs(u);
    dis[u] = 0;
    cout << ans << '\n';
}
void solve()
{
    cin >> n >> m;
    iota(uni + 1, uni + n + 1, 1);
    for (int i = 1, u, v; i <= 1 + n; i++)
    {
        cin >> u >> v;
        int fx = find(u), fy = find(v);
        if (fx != fy)
        {
            adj[u].push_back(v);
            adj[v].push_back(u);
            uni[fx] = fy;
        }
        else
        {
            if (a[0] == pair<int, int>{0, 0})
                a[0] = {u, v};
            else
                a[1] = {u, v};
        }
    }
    dfs1(0, 1);
    dfs2(1, 1);
    for (int i = 1; i <= m; i++)
    {
        cin >> p[1] >> p[2];
        tie(p[3], p[4]) = a[0];
        tie(p[5], p[6]) = a[1];
        k = 6;
        solve(p[1], p[2]);
    }
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}