#include <bits/stdc++.h>
using namespace std;
const int MXN = 5e4 + 7;

int n, q, far[MXN][21], dpt[MXN];

vector<int> g[MXN];

int val[2][2], fg;

bool vs[MXN];
void build_tre(int u) {
    dpt[u] = dpt[far[u][0]] + 1;
    for(int k=1; k<21; ++k)
        far[u][k] = far[far[u][k-1]][k-1];
    vs[u] = 1;
    for(int v:g[u]) {
        if(!vs[v]) {
            far[v][0] = u;
            build_tre(v);
        } else if(v>u) {
            if(fg) val[1][0] = u, val[1][1] = v;
            else val[0][0] = u, val[0][1] = v, fg = 1;
        }
    }
}

int get_far(int u, int ds) {
    for(int cnt=0; ds; ds>>=1) {
        if(ds&1) {
            u = far[u][cnt];
            cnt = 0;
        } else ++cnt;
    }
    return u;
}

int get_lca(int l, int r) {
    if(dpt[l]<dpt[r]) swap(l, r);
    l = get_far(l, dpt[l]-dpt[r]);
    if(l==r) return l;
    for(int k=20; k>=0; --k) {
        if(far[l][k]!=far[r][k]) {
            l = far[l][k];
            r = far[r][k];
        }
    }
    return far[l][0];
}

bool adj(int a, int b, int c, int d) {
    int arr[] = {get_lca(a, c), get_lca(a, d), get_lca(b, c), get_lca(b, d)};
    sort(arr, arr+4, [](int l, int r){ return dpt[l]>dpt[r]; });
    return (arr[0]!=arr[1])||(dpt[arr[0]]>=max(dpt[get_lca(a, b)], dpt[get_lca(c, d)]));
}

void solve() {
    for(int i=0, u, v, cnt; i<q; ++i) {
        cin >> u >> v;
        cnt = 1;
        for(int j=0; j<=1; ++j) {
            if(!adj(u, val[j][0], v, val[j][1])||!adj(u, val[j][1], v, val[j][0]))
                ++cnt;
        }
        for(int j=0; j<=1; ++j) {
            for(int k1=0; k1<=1; ++k1) {
                for(int k2=0; k2<=1; ++k2) {
                    if(!adj(u, val[j][k1], val[j][!k1], val[!j][k2])
                        &&!adj(val[j][!k1], val[!j][k2], val[!j][!k2], v)
                        &&!adj(u, val[j][k1], val[!j][!k2], v)) {
                            ++cnt;
                        }
                }
            }
        }
        cout << cnt << '\n';
    }
}

void pre() {
    cin >> n >> q;
    for(int i=0, u, v; i<=n; ++i) {
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    far[1][0] = 1;
    build_tre(1);
}

int t_=1;
void init() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    // cin >> t_;
}

int main() {
    init();
    for(int i=1; i<=t_; ++i) {
        pre(); solve();
    }
    return 0;
}