#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
using namespace std;

using vi = vector<int>;

constexpr int N = 1e5 + 9;
constexpr int M = 2e5 + 9;
constexpr int K = 12;
constexpr int INF = 1e9;
int n, m, k, Q, as[M];
vi G[N];

struct qNode {
  int o, x, y;
  qNode (int o = 0, int x = 0, int y = 0) : o(o), x(x), y(y) {}
};
vector<qNode> q[N], qq;

bool h[N];
vi e[N], g[N];
IL void dfs (int u, int fa) {
  h[u] = 1;
  for (int v : G[u]) {
    if (v ^ fa) {
      if (h[v]) {
        e[u].eb(v);
      } else {
        g[u].eb(v);
        dfs(v, u);
      }
    }
  }
  if (fa) {
    g[u].eb(fa);
  }
}

bool used[N], vis[N];
vi vc, key;

IL void dfs1 (int u, int fa) {
  vc.eb(u);
  if (!q[u].empty()) {
    int sz = qq.size();
    qq.insert(qq.end(), q[u].begin(), q[u].end());
    inplace_merge(qq.begin(), qq.begin() + sz, qq.end(), [] (auto i, auto j) {
      return i.y < j.y;
    });
  }
  bool fl = 0;
  for (int v : g[u]) {
    if (used[v] || v == fa) {
      continue;
    }
    if (vis[v]) {
      fl = 1;
    } else {
      dfs1(v, u);
    }
  }
  if (fl) {
    key.eb(u);
  }
}

IL void dfs2 (int u, int fa) {
  vis[u] = 1;
  for (int v : g[u]) {
    if (!used[v] && v ^ fa) {
      dfs2(v, u);
    }
  }
}

int R, sz[N], S;

IL void dfs3 (int u, int fa) {
  sz[u] = 1;
  int mx = 0;
  for (int v : g[u]) {
    if (used[v] || v == fa) {
      continue;
    }
    dfs3(v, u);
    sz[u] += sz[v];
    mx = max(mx, sz[v]);
  }
  mx = max(mx, S - sz[u]);
  if (mx <= S / 2) {
    R = u;
  }
}

IL void bfs (int s, int *d) {
  for (auto v : vc) {
    d[v] = INF;
  }
  queue<int> q;
  d[s] = 0;
  q.push(s);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : G[u]) {
      if (vis[v] && d[v] > d[u] + 1) {
        d[v] = d[u] + 1;
        q.push(v);
      }
    }
  }
}

int d[K][N], mn[K];

IL void dfz (int u) {
  vc = key = {u};
  qq = q[u];
  vis[u] = 1;
  for (int v : G[u]) {
    if (!used[v] && !vis[v]) {
      dfs1(v, u);
      dfs2(v, u);
    }
  }
  int kk = key.size();
  L (i, 0, kk - 1) {
    bfs(key[i], d[i]);
    mn[i] = INF;
  }
  L (i, 1, (int)qq.size() - 1) {
    assert(qq[i].y > qq[i - 1].y);
  }
  for (auto [o, x, y] : qq) {
    if (o & 1) {
      L (i, 0, kk - 1) {
        mn[i] = min(mn[i], d[i][x]);
      }
    } else {
      L (i, 0, kk - 1) {
        as[y] = min(as[y], mn[i] + d[i][x]);
      }
    }
  }
  for (int v : vc) {
    vis[v] = 0;
  }
  used[u] = 1;
  dfs3(u, 0);
  for (int v : G[u]) {
    if (!used[v]) {
      S = sz[v];
      dfs3(v, u);
      dfz(R);
    }
  }
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> k;
  L (i, 1, m) {
    int u, v;
    cin >> u >> v;
    G[u].eb(v);
    G[v].eb(u);
  }
  cin >> Q;
  fill(as + 1, as + Q + 1, -1);
  L (i, 1, Q) {
    int o, x;
    cin >> o >> x;
    q[x].eb(o, x, i);
    if (o ^ 1) {
      as[i] = INF;
    }
  }
  dfs(1, 0);
  S = n;
  dfs3(1, 0);
  dfz(R);
  L (i, 1, Q) {
    if (~as[i]) {
      cout << as[i] << '\n';
    }
  }
}
// I love WHQ!