#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

std::vector<std::vector<int> > hen;

std::vector<int> ord, out;
std::vector<int> tour;
int ord_cnt = 0;
std::vector<int> low;
std::vector<int> depth;
std::vector<std::vector<int> > parent;

void dfs0(int i, int prev) {
	parent[0][i] = prev;
	ord[i] = ord_cnt++;
	tour.push_back(i);
	low[i] = ord[i];
	for (auto j : hen[i]) {
		if (j == prev) continue;
		if (ord[j] == -1) {
			depth[j] = depth[i] + 1;
			dfs0(j, i);
			low[i] = std::min(low[i], low[j]);
		} else low[i] = std::min(low[i], ord[j]);
	}
	out[i] = ord_cnt;
}
std::vector<int> sum;
void dfs1(int i) {
	sum[i] += parent[0][i] != -1 && low[i] >= ord[parent[0][i]];
	for (auto j : hen[i]) if (depth[j] == depth[i] + 1) {
		sum[j] = sum[i];
		dfs1(j);
	}
}

int main() {
	int n = ri();
	int m = ri();
	hen.resize(n);
	for (int i = 0; i < m; i++) {
		int a = ri() - 1;
		int b = ri() - 1;
		hen[a].push_back(b);
		hen[b].push_back(a);
	}
	
	ord.resize(n, -1);
	out.resize(n, -1);
	low.resize(n);
	depth.resize(n);
	parent.resize(20, std::vector<int>(n, -1));
	dfs0(0, -1);
	for (int i = 1; i < 20; i++) for (int j = 0; j < n; j++)
		parent[i][j] = parent[i - 1][j] == -1 ? -1 : parent[i - 1][parent[i - 1][j]];
	
	sum.resize(n);
	dfs1(0);
	
	int q = ri();
	for (int i = 0; i < q; i++) {
		int a = ri() - 1;
		int b = ri() - 1;
		if (depth[a] < depth[b]) std::swap(a, b);
		int res;
		if (a == b) res = 0;
		else if (ord[a] >= ord[b] && out[a] <= out[b]) { // a is a descendant of b
			res = sum[a];
			for (int k = 20; k--; ) if ((depth[a] - depth[b] - 1) >> k & 1) a = parent[k][a];
			res -= sum[a];
		} else {
			res = sum[a] + sum[b];
			for (int k = 20; k--; ) if ((depth[a] - depth[b]) >> k & 1) a = parent[k][a];
			for (int k = 20; k--; ) if (parent[k][a] != parent[k][b]) a = parent[k][a], b = parent[k][b];
			res -= sum[a] + sum[b];
			int x = ord[parent[0][a]];
			if (low[a] >= x || low[b] >= x) res++;
		}
		printf("%d\n", res);
	}
	return 0;
}