#include <bits/stdc++.h>

typedef long long ll;
#define int ll

#define pb push_back
#define fi first
#define se second

using namespace std;

const int N = 500500;

vector<pair<int, int> > ed;
int U1, V1, U2, V2;

int n;
vector<int> g[N];
int p[N][20];
int dep[N];
int tin[N];
int tout[N];
int t = 0;

void dfs(int v, int pr)
{
    t++;
    tin[v] = t;
    p[v][0] = pr;
    for (int i : g[v])
        if (i!=pr)
        {
            if (p[i][0] == -1)
            {
                dep[i] = dep[v] + 1;
                dfs(i, v);
            }
            else if (i < v)
                ed.pb({i, v});
        }
    t++;
    tout[v] = t;
}
void solve()
{
    for (int i=1; i<=n; i++)
        p[i][0] = -1;
    dfs(1, 1);
    U1 = ed[0].fi;
    V1 = ed[0].se;
    U2 = ed[1].fi;
    V2 = ed[1].se;
    for (int i=1; i<20; i++)
        for (int v=1; v<=n; v++)
            p[v][i] = p[p[v][i-1]][i-1];
//    cout<<U1<<" "<<V1<<" "<<U2<<" "<<V2<<" "<<p[3][0]<<" "<<p[3][1]<<" "<<dep[2]<<" "<<dep[3]<<"\n";
}
int lca(int u, int v)
{
    if (dep[u] > dep[v]) swap(u, v);
    for (int i=19; i>=0; i--)
        if (dep[p[v][i]] >= dep[u])
            v = p[v][i];
    for (int i=19; i>=0; i--)
        if (p[v][i] != p[u][i])
            v = p[v][i], u = p[u][i];
    if (u!=v)
        v = p[v][0];
    return v;
}
bool isp(int a, int b)
{
    return (tin[b] >= tin[a] && tout[b] <= tout[a]);
}
bool onseg(int x, int a, int b, int l)
{
    return isp(l, x) && (isp(x, a) || isp(x, b));
}
bool inner(int x, int y, int a, int b)
{
    int l = lca(a, b);
//    cout<<"lca "<<a<<" "<<b<<" "<<l<<"\n";
    if (onseg(x, a, b, l))
        return true;
    if (onseg(y, a, b, l))
        return true;
    return onseg(lca(x, y), a, b, l);
}
bool inter(int x, int y, int a, int b)
{
    if (inner(x, y, a, b) || inner(a, b, x, y))
    {
//        cout<<x<<" "<<y<<" "<<a<<" "<<b<<" "<<1<<"\n";
        return true;
    }
//    cout<<x<<" "<<y<<" "<<a<<" "<<b<<" "<<0<<"\n";
    return false;
}
bool ask(vector<pair<int, int> > w)
{
    int m = w.size();
    for (int i=0; i<m; i++)
        for (int j=i+1; j<m; j++)
            if (inter(w[i].fi, w[i].se, w[j].fi, w[j].se))
                return false;
    return true;
}
int ask(int x, int y)
{
    int ans = 1;
    for (int mask=0; mask<2; mask++)
    {
        int u1 = U1, v1 = V1, u2 = U2, v2 = V2;
        if (mask&1) swap(u1, v1), swap(u2, v2);
        if (ask({ {x, u1}, {v1, y} })) ans++;
        if (ask({ {x, u2}, {v2, y} })) ans++;
    }

    for (int mask=0; mask<4; mask++)
    {
        int u1 = U1, v1 = V1, u2 = U2, v2 = V2;
        if (mask&1) swap(u1, v1);
        if (mask&2) swap(u2, v2);
        if (ask({ {x, u1}, {v1, u2}, {v2, y} })) ans++;
        if (ask({ {x, u2}, {v2, u1}, {v1, y} })) ans++;
    }
    return ans;
}

main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int q;
    cin>>n>>q;
    for (int i=1; i<=n+1; i++)
    {
        int x, y;
        cin>>x>>y;
        g[x].pb(y);
        g[y].pb(x);
    }

    solve();
    for (int i=1; i<=q; i++)
    {
        int x, y;
        cin>>x>>y;
        cout<<ask(x, y)<<"\n";
    }

}