#include<cstdio>

#include<iostream>

#include<cstring>

#include<cstdlib>

#include<algorithm>

#include<cmath>

using namespace std;

struct node

{

    int x,y,next;

}a[];int len,last[];

void ins(int x,int y)

{

    len++;

    a[len].x=x;a[len].y=y;

    a[len].next=last[x];last[x]=len;

}

int z,dfn[],low[];

bool b[];

void tarjan(int x,int fr)

{

    dfn[x]=low[x]=++z;

    for(int k=last[x];k;k=a[k].next)

    {

        int y=a[k].y;

        if(dfn[y]==)

        {

            tarjan(y,x);

            low[x]=min(low[x],low[y]);

            if(dfn[x]<low[y])

                b[k]=b[k^]=true;

        }

        if(y!=fr)

            low[x]=min(low[x],dfn[y]);

    }

}

int cnt,bel[];

void sdfj(int x,int fr)

{

    bel[x]=cnt;

    for(int k=last[x];k;k=a[k].next)

    {

        int y=a[k].y;

        if(bel[y]==&&b[k]==false)

            sdfj(y,x);

    }

}

//--------------------缩点----------------------

int Bin[];

int f[][],dep[];

void dfs(int x)

{

    for(int i=;dep[x]>=Bin[i];i++)f[i][x]=f[i-][f[i-][x]];

    for(int k=last[x];k;k=a[k].next)

    {

        int y=a[k].y;

        if(y!=f[][x])

        {

            f[][y]=x;

            dep[y]=dep[x]+;

            dfs(y);

        }

    }

}

int LCA(int x,int y)

{

    if(dep[x]<dep[y])swap(x,y);

    for(int i=;i>=;i--)

        if(dep[x]-dep[y]>=Bin[i])x=f[i][x];

    if(x==y)return x;

    for(int i=;i>=;i--)

        if(dep[x]>=Bin[i]&&f[i][x]!=f[i][y])x=f[i][x],y=f[i][y];

    return f[][x];

}

int main()

{

    int n,m,T_T=;

    scanf("%d%d",&n,&m);

    len=;memset(last,,sizeof(last));

    int x,y;

    for(int i=;i<=m;i++)

    {

        scanf("%d%d",&x,&y);

        ins(x,y);ins(y,x);

    }

    z=;

    memset(dfn,,sizeof(dfn));

    memset(low,,sizeof(low));

    memset(b,false,sizeof(b));

    tarjan(,);

    cnt=;

    memset(bel,,sizeof(bel));

    for(int i=;i<=n;i++)

        if(bel[i]==) cnt++, sdfj(i,);

    int tp=;

    memset(last,,sizeof(last));

    for(int i=;i<=len;i++)

    {

        if(bel[a[i].x]!=bel[a[i].y])

        {

            tp++;

            a[tp].x=bel[a[i].x];

            a[tp].y=bel[a[i].y];

            a[tp].next=last[a[tp].x];

            last[a[tp].x]=tp;

        }

    }

    len=tp;

    Bin[]=;for(int i=;i<=;i++)Bin[i]=Bin[i-]*;

    f[][]=;dep[]=;dfs();

    int Q,ans=cnt-;

    scanf("%d",&Q);

    while(Q--)

    {

        scanf("%d%d",&x,&y);x=bel[x],y=bel[y];

        int lca=LCA(x,y);

        printf("%d\n",dep[x]-dep[lca]+dep[y]-dep[lca]);

    }

    return ;

}