#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
typedef long long ll;
typedef long double ld;
int input=0;
const ll inf=2e18;
const int N=50014;
vector<int>g[N];
int n,col[N],deg[N],leaf[N];
int h[N];
int get(int x){return x==h[x]?x:h[x]=get(h[x]);}
void top(){
    iota(h,h+n+3,0);
    queue<int>q;
    for(int i=1;i<=n;i++)if(deg[i]==1)q.push(i);
    while(!q.empty()){
        int x=q.front();q.pop(),leaf[x]=1;
        for(auto i:g[x]){
            h[get(x)]=get(i);
            if((--deg[i])==1)q.push(i);
        }
    }
}
int f[N];
int find(int x){return x==f[x]?x:f[x]=find(f[x]);}
vector<int>mp[N];
int s,t,r;
int vis[N];
void dfs(int x){
    if(x==t){r++;return;}
    vis[x]=1;
    for(auto i:mp[x])if(!vis[i])dfs(i);
    vis[x]=0;
}
void solve(){int q,z=0;
    cin>>n>>q;
    vector<pair<int,int>>eg;
    for(int i=1,x,y;i<=n+1;i++)
        cin>>x>>y,g[x].push_back(y),g[y].push_back(x),eg.emplace_back(x,y),deg[x]++,deg[y]++;
    top();
    iota(f,f+n+3,0);
    for(int i=1;i<=n;i++)if(deg[i]>2)col[i]=i;
    for(auto[x,y]:eg)if(leaf[x]||leaf[y]||!col[x]&&!col[y])f[find(x)]=find(y);
    vector<pair<int,int>>eg_;
    for(auto[x,y]:eg)if((x=find(x))^(y=find(y)))eg_.emplace_back(x,y);
    while(q--){
        cin>>s>>t,r=0;
        s=get(s),t=get(t);
        if(s==t){
            cout<<1<<'\n';
            continue;
        }
        s=find(s),t=find(t);
        if(s==t){
            int f=0;
            t=0;
            for(auto[x,y]:eg)
                if(!f&&(x==s||y==s))mp[x].push_back(0),mp[y].push_back(0),mp[0].push_back(x),mp[y].push_back(x);
                else mp[x].push_back(y),mp[y].push_back(x);
        }else{
            for(auto[x,y]:eg)mp[x].push_back(y),mp[y].push_back(x);
        }
        dfs(s);
        cout<<r<<'\n';
        mp[0].clear();
        for(auto[x,y]:eg)mp[x].clear(),mp[y].clear();
    }
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cout<<fixed<<setprecision(10);
    int T;
    if(input)cin>>T;else T=1;
    for(int tc=1;tc<=T;tc++)solve();
}