//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
bool chmin(T &a,T b){if(a>b){a=b;return true;}else return false;}
template<typename T>
bool chmax(T &a,T b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
struct Lowlink{
  vector<vector<int>>G;
  int size;
  vector<int>ord,low,used;
  vector<int>articulation;
  vector<pair<int,int>>bridge;
  Lowlink(vector<vector<int>>&g):G(g){
    size = G.size();
    ord.assign(size,-1);
    low.assign(size,-1);
    used.assign(size,0);
    int tmp=0;
    for(int i=0;i<size;i++){
      if(!used[i]){
        dfs(i,tmp,-1);
      }
    }
  }
  void dfs(int k,int &num,int par){
    ord[k] = num;
    low[k] = num;
    num++;
    used[k] = 1;
    int cnt=0;
    bool is_articulation=false;
    bool multiple=false;
    for(int i=0;i<G[k].size();i++){
      if(!multiple&&par==G[k][i]){
        multiple=true;
        continue;
      }
      if(used[G[k][i]]){
        chmin(low[k],ord[G[k][i]]);
      }
      else{
        cnt++;
        dfs(G[k][i],num,k);
        chmin(low[k],low[G[k][i]]);
        if(ord[k]<low[G[k][i]])bridge.emplace_back(k,G[k][i]);
        if(ord[k]<=low[G[k][i]]&&par!=-1)is_articulation=true;
      }
    }
    if(par==-1&&cnt>=2)is_articulation=true;
    if(is_articulation)articulation.push_back(k);
    return; 
  }
  vector<int>tecc_index;//二重辺連結成分の番号
  vector<vector<int>>tecc_edges;
  int TECC(){
    tecc_index.assign(G.size(),-1);
    int cnt=0;
    for(int i=0;i<size;i++){
      if(tecc_index[i]==-1)dfs_tecc(i,-1,cnt);
    }
    tecc_edges.assign(cnt+1,vector<int>());
    for(int i=0;i<bridge.size();i++){
      int u=tecc_index[bridge[i].fi],v=tecc_index[bridge[i].se];
      tecc_edges[u].push_back(v);
      tecc_edges[v].push_back(u);
    }
    return *max_element(tecc_index.begin(),tecc_index.end())+1;
  }
  void dfs_tecc(int k,int par,int &group){
    if(par==-1||ord[par]<low[k]){
      tecc_index[k] = group++;
    }
    else tecc_index[k] = tecc_index[par];
    for(int i=0;i<G[k].size();i++){
      if(tecc_index[G[k][i]]==-1)dfs_tecc(G[k][i],k,group);
    }
  }
  vector<vector<pair<int, int>>>bcc;
  stack<pair<int, int>>tmp;
  void BCC(){
    used.assign(G.size(), false);
    for(int i=0;i<G.size();i++){
      if(!used[i]){
        dfs_bcc(i, -1);
      }
    }
  }
  void dfs_bcc(int k, int par){
    used[k]=true;
    for(auto to:G[k]){
      if(to==par)continue;
      if(!used[to] | ord[to] < ord[k]){
        tmp.emplace(minmax(k, to));
      }
      if(!used[to]){
        dfs_bcc(to, k);
        if(low[to] >= ord[k]){
          bcc.emplace_back();
          while(1){
            auto e = tmp.top();
            bcc.back().emplace_back(e);
            tmp.pop();
            if(e.first == min(k, to) && e.second == max(k, to))break;
          }
        }
      }
    }
  }
  vector<vector<int>>bct_edges;
  vector<int>bct_index;
  vector<bool>art;
  void makeBCT(){
    assert(bcc.empty());
    BCC();
    art.assign(G.size(), false);
    bct_index.assign(G.size(), -1);
    for(auto v:articulation){
      bct_index[v] = bct_edges.size();
      bct_edges.emplace_back();
      art[v] = true;
    }
    vector<bool>check(G.size(),false);
    for(auto &ev:bcc){
      int idx = bct_edges.size();
      bct_edges.emplace_back();
      queue<int>rev;
      for(auto &e:ev){
        for(auto &v:{e.first, e.second}){
          if(art[v]&&!check[v]){
            rev.push(v);
            check[v] = true;
            bct_edges[idx].push_back(bct_index[v]);
            bct_edges[bct_index[v]].push_back(idx);
          }
          else if(!art[v]){
            bct_index[v] = idx;
          }
        }
      }
      while(!rev.empty()){
        check[rev.front()] = false;
        rev.pop();
      }
    }
  }
};
struct edge{
  ll to=-1,cost=0;
  edge(){};
  edge(ll t,ll c):to(t),cost(c){};
};
struct HLD{
  ll n, root;
  ll cnt = 0;
  vector<ll>sz;//部分木サイズ
  vector<ll>par,head;
  vector<vector<struct edge>>g;//隣接リスト
  vector<struct edge>edges;//データ構造に乗せるedge列
  vector<ll>in,out;//[in,out)で部分木、[ina,inb]でa~bのパス(aが上)
  //inは頂点のindexを表す。また、edge列の下側の頂点である
  HLD(vector<vector<struct edge>>&G,ll r = -1)
      :g(G),n(G.size()),root(r){
    par.assign(n,-1),in.assign(n,-1);
    out.assign(n,-1),head.assign(n,-1),sz.assign(n,-1);
    edges.assign(n,edge());
    dfs_build();
  }
  void dfs_build(){
    if(root == -1){//根がどこでも良い場合(森でも可)
      for(ll i=0;i<n;i++){
        if(sz[i] == -1){
          head[i] = i;
          dfs_sz(i);
          dfs_hld(i);
        }
      }
    }
    else{
      head[root] = root;
      dfs_sz(root);
      dfs_hld(root);
    }
  }
  void dfs_sz(ll k){
    sz[k] = 1;
    for(auto &e: g[k]){
      if(e.to == par[k])continue;
      par[e.to] = k;
      dfs_sz(e.to);
      sz[k] += sz[e.to];
      if(sz[e.to] > sz[g[k][0].to])swap(e, g[k][0]);
    }
  }
  void dfs_hld(ll k){
    in[k] = cnt++;
    for(auto e:g[k]){
      if(e.to == par[k])continue;
      head[e.to] = (e.to == g[k][0].to ? head[k]: e.to);
      edges[cnt] = e;
      dfs_hld(e.to);
    }
    out[k] = cnt;
  }
  ll lca(ll p,ll q){
    while(1){
      if(in[p] < in[q])swap(p,q);
      if(head[p] == head[q])return q;
      p = par[head[p]];
    }
  }
  vector<pair<ll,ll>>query_path(ll p,ll q,bool isEdge){
    ll r=lca(p,q);
    vector<pair<ll,ll>>ret;
    for(ll i=0;i<2;i++){
      if(i == 1)swap(p,q);
      while(1){
        if(isEdge&&p==r)break;
        if(head[p]==head[r]){
          ret.emplace_back(in[r]+(isEdge?1:i),in[p]+1);
          break;
        }
        ret.emplace_back(in[head[p]],in[p]+1);
        p = par[head[p]];
      }
    }
    return ret;
  }
  vector<vector<pair<ll,ll>>>query_order_path(ll p,ll q,bool isEdge){
	//非可換クエリ用、配列0を順番を反転したデータ構造に、配列1を通常のデータ構造に
    vector<vector<pair<ll,ll>>>ret(2);
    ll r=lca(p,q);
    for(ll i=0;i<2;i++){
      if(i == 1)swap(p,q);
      while(1){
        if(isEdge&&p==r)break;
        if(head[p]==head[r]){
          if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[r]+(isEdge?1:i)));
          else ret[i].emplace_back(in[r]+(isEdge?1:i),in[p]+1);
          break;
        }
        if(i==0) ret[i].emplace_back(n-(in[p]+1),n-(in[head[p]]));
        else ret[i].emplace_back(in[head[p]],in[p]+1);
        p = par[head[p]];
      }
    }
    reverse(ret[1].begin(), ret[1].end());
    return ret;
  }
  pair<ll,ll>query_subtree(ll p,bool isEdge){
    return make_pair(in[p]+isEdge,out[p]);
  }
  //uのv方向の子 子孫関係は前もって確認すること
  ll child(ll u,ll v){
    while(1){
      if(head[u]==head[v]){
        v=g[u][0].to;
        break;
      }
      v=head[v];
      if(par[v]==u)break;
      v=par[v];
    }
    return v;
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  int n,m;cin>>n>>m;
  vector<vector<int>>g(n);
  rep(i,0,m){
    int u,v;cin>>u>>v;u--;v--;
    g[u].PB(v);
    g[v].PB(u);
  }
  Lowlink low(g);
  low.makeBCT();
  auto bct=low.bct_edges;
  auto idx=low.bct_index;
  ll sz=bct.size();
  vector<vector<edge>>gh(sz);
  //debug(idx,n);
  rep(i,0,sz){
    for(auto to:bct[i]){
      //cout<<i spa to<<endl;
      gh[i].EB(to,0);
    }
  }
  HLD hld(gh);
  vector<ll>a(sz+1);
  for(auto z:low.articulation)a[hld.in[idx[z]]+1]=1;
  rep(i,0,sz)a[i+1]+=a[i];
  ll q;cin>>q;
  while(q--){
    ll c,d;cin>>c>>d;c--;d--;
    ll ret=-(ll)low.art[c]-(ll)low.art[d];
    auto tmp=hld.query_path(idx[c],idx[d],false);
    for(auto z:tmp){
      ret+=a[z.se]-a[z.fi];
    }
    cout<<max(0LL,ret)<<endl;
  }
  return 0;
}