//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("obiective.in");
ofstream out("obiective.out");
int n,m,nr,p,c;
const int Max=32005;
const int Maxd=64000;
vector < pair < int ,int > >gg[Max];
vector < int >d,dist,q[Maxd];
bool comp(pair < int , int > (&a),pair < int , int >(&b))
{
    return a.second<b.second;
}
void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        in>>x>>y;
        gg[x].push_back(make_pair(y,0));
        gg[y].push_back(make_pair(x,1));
    }
}

void initializare()
{
    d.push_back(0);
    for(int i=1;i<=n;i++)
      d.push_back(INT_MAX);
}

void Dijkstra(int x,int y)
{
   dist=d;
   dist[x]=0;
   q[0].push_back(x);
   for(int t=0;t<m;t++)
   {
       for(int i=0;i<q[t].size();i++)
       {
           if(dist[q[t][i]]==t)
           {
               for(int j=0;j<gg[q[t][i]].size();j++)
               {
                   int vecin=gg[q[t][i]][j].first;
                   int cost=gg[q[t][i]][j].second;
                   if(dist[vecin]>dist[q[t][i]]+cost)
                   {
                       dist[vecin]=dist[q[t][i]]+cost;
                       q[dist[vecin]].push_back(vecin);
                   }
               }
           }
       }
         q[t].clear();
   }
  out<<dist[y]<<"\n";

}

int main()
{
    citire();
    initializare();
      in>>p;
      for(int i=1;i<=n;i++)
        sort(gg[i].begin(),gg[i].end(),comp);
    for(int i=1;i<=p;i++)
    {
        int x,y;
        in>>x>>y;
        Dijkstra(x,y);

    }
    return 0;
}