#include <stdio.h>

 #include <string.h>

 #include <queue>

 #include <algorithm>

 #include <stack>

 const int N=;

 using namespace std;

 struct node

 {

     int u,v,w;

     int next;

 } edge[N*];

                               //dfn[i]表示点i的深度优先数;

 int dfn[N],low[N],head[N];    //low[i]表示点i可到达的最低深度优先数

 int vis[N],bridge[N],f[N];

 int n,m,cnt,dfs_clock,Conn_cnt;

 int ans ;

 stack<int>S;

 void init()

 {

     ans = ;

     cnt = ;

     dfs_clock = ;

     Conn_cnt = ;

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

         f[i] = i;

     memset(dfn,,sizeof(dfn));

     memset(low,,sizeof(low));

     memset(vis,,sizeof(vis));

     memset(head,-,sizeof(head));

 }

 void add(int u,int v)

 {

     edge[cnt].v = v;

     edge[cnt].next = head[u];

     head[u] = cnt++;

     edge[cnt].v = u;

     edge[cnt].next = head[v];

     head[v] =cnt++;

 }

 void dfs(int u)//Tarjan算法

 {

     vis[u] = ;

     dfn[u]=low[u]=++dfs_clock;//设定初值

     S.push(u);//将节点u压入栈中

     for (int i = head[u]; i!=-; i=edge[i].next)//遍历u的临接点

     {

         int v = edge[i].v;

         if (!vis[v])//如果改点的深度优先数为0(即没有搜索过)

         {

             f[v] = u;//记录父节点

             dfs(v);//继续向下找

             low[u] = min(low[u],low[v]);//回溯过程中计算low[]的值

             if(low[v] > dfn[u])

             {

                 ans++;

                 bridge[v] = ;//标记点u->v为桥

             }

         }

         else if(vis[v]==&&v!=f[u])

         {

             low[u] = min(low[u],dfn[v]);

         }

     }

     vis[u] = ;

 }

 void LCA(int u,int v)

 {

     if (dfn[u] < dfn[v])

         swap(u,v);

     while(dfn[u] > dfn[v])

     {

         if (bridge[u])

         {

             ans--;

             bridge[u] = ;

         }

         u = f[u];

     }

     while(u!=v)

     {

         if (bridge[u])

         {

             ans--;

             bridge[u] = ;

         }

         if (bridge[v])

         {

             ans--;

             bridge[v] = ;

         }

         u = f[u];

         v = f[v];

     }

 }

 int main()

 {

     int u,v,o = ;

     while(~scanf("%d%d",&n,&m))

     {

         if (n==&&m==)

             break;

         init();

         o++;

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

         {

             scanf("%d%d",&u,&v);

             add(u,v);

         }

         dfs();

         int t;

         scanf("%d",&t);

         printf("Case %d:\n",o);

         while(t--)

         {

             scanf("%d%d",&u,&v);

             LCA(u,v);

             printf("%d\n",ans);

         }

         puts("");

     }

     return ;

 }