#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 5;

struct Edge {
    int a, b, x, y, v;
} E[N];

vector<int> G[N];
int n, dfn[N], low[N], inS[N], wh[N];
stack<int> S;

void Tarjan(int x, int fa = -1) {
    dfn[x] = low[x] = ++dfn[0], inS[x] = 1;
    S.push(x);
    for (auto v : G[x]) {
        if (v == fa) fa = -1;
        else {
            if (!dfn[v]) {
                Tarjan(v, x);
                low[x] = min(low[x], low[v]);
            } else low[x] = min(low[x], dfn[v]);
        }
    }
    if (low[x] == dfn[x]) {
        int v;
        do {
            v = S.top(), S.pop(), inS[v] = 0;
            wh[v] = x;
        } while (v != x);
    }
}

void dfs(int l, int r, int L, int R) {
    if (l > r || L == R) return;
    int mid = (L + R) >> 1, p = r;
    for (int i = r; i >= l; --i) {
        if (E[i].v > mid) swap(E[i], E[p--]);
    }
    for (int i = l; i <= p; ++i) {
        G[E[i].x].push_back(E[i].y), G[E[i].y].push_back(E[i].x);
    }
    for (int i = l; i <= p; ++i) {
        if (!dfn[E[i].x]) Tarjan(E[i].x);
        if (!dfn[E[i].y]) Tarjan(E[i].y);
    }
    for (int i = p; i >= l; --i) {
        if (wh[E[i].x] != wh[E[i].y]) swap(E[i], E[p--]);
    }
    for (int i = p + 1; i <= r; ++i) {
        if (wh[E[i].x]) E[i].x = wh[E[i].x];
        if (wh[E[i].y]) E[i].y = wh[E[i].y];
        E[i].v = mid + 1;
    }
    for (int i = l; i <= r; ++i) {
        G[E[i].x].clear(), G[E[i].y].clear();
        dfn[E[i].x] = dfn[E[i].y] = wh[E[i].x] = wh[E[i].y] = 0;
    }
    dfn[0] = 0;
    dfs(l, p, L, mid), dfs(p + 1, r, mid + 1, R);
}

vector< pair<int, int> > ad[N];
int fa[N << 1], fat[20][N << 1], val[20][N << 1], dep[N << 1];

int find(int x) {
    return (fa[x] == x ? x : fa[x] = find(fa[x]));
}

signed main() {
    int m; scanf("%d%d", &n, &m);
    for (int i = 1; i <= m; ++i) {
        scanf("%d%d", &E[i].x, &E[i].y);
        E[i].a = E[i].x, E[i].b = E[i].y, E[i].v = i;
    }
    dfs(1, m, 1, m + 1);
    for (int i = 1; i <= m; ++i) {
        ad[E[i].v].push_back(make_pair(E[i].a, E[i].b));
    }
    for (int i = 1; i <= n; ++i) fa[i] = i;
    int tot = n;
    for (int i = 1; i <= m; ++i) {
        for (auto [x, y] : ad[i]) {
            if (find(x) != find(y)) {
                x = find(x), y = find(y), ++tot;
                val[0][x] = val[0][y] = i;
                fat[0][x] = fat[0][y] = fa[x] = fa[y] = fa[tot] = tot;
            }
        }
    }
    for (int i = 1; i < 20; ++i) {
        for (int j = tot; j; --j) {
            fat[i][j] = fat[i - 1][fat[i - 1][j]];
            val[i][j] = max(val[i - 1][j], val[i - 1][fat[i - 1][j]]);
        }
    }
    for (int i = tot; ~i; --i) {
        dep[i] = dep[fat[0][i]] + 1;
    }
    int q; scanf("%d", &q);
    for (int i = 1, x, y; i <= q; ++i) {
        scanf("%d%d", &x, &y);
        if (find(x) != find(y)) {
            puts("-1");
        } else {
            if (dep[x] < dep[y]) swap(x, y);
            int res = 0;
            for (int j = 19; ~j; --j) {
                if (dep[fat[j][x]] >= dep[y]) {
                    res = max(res, val[j][x]);
                    x = fat[j][x];
                }
            }
            if (x != y) {
                for (int j = 19; ~j; --j) {
                    if (fat[j][x] != fat[j][y]) {
                        res = max(res, max(val[j][x], val[j][y]));
                        x = fat[j][x], y = fat[j][y];
                    }
                }
                res = max(res, max(val[0][x], val[0][y]));
            }
            printf("%d\n", res);
        }
    }
    return 0;
}