// Problem: G. Giant Penguin
// Contest: Codeforces - 300iq Contest 3
// URL: https://codeforces.com/gym/102538/problem/G
// Memory Limit: 512 MB
// Time Limit: 3000 ms

#include<bits/stdc++.h>
using namespace std;
const int maxK = 12;
const int maxn = 1e5 + 10;
const int inf = 1e9+114;
vector<int> G[maxn], T[maxn];
int tfa[maxn];
bool vis[maxn];
int siz[maxn];
int n, m, K, q;
void MakeTree(int u) {
    vis[u] = true;
    siz[u] = 1;
    for(int v : G[u]) {
        if(vis[v]) continue;
        T[u].emplace_back(v), T[v].emplace_back(u);
        MakeTree(v);
        siz[u] += siz[v];
    }
}
int totsize;
int FindRt(int u, int fa) {
    if(siz[u] * 2 < totsize) return -1;
    int rt = u;
    for(int v : T[u]) {
        if(v == fa || vis[v]) continue;
        int tmp = FindRt(v, u);
        if(~tmp) rt = tmp;
    }
    return rt;
}
int keyp[maxn][maxK];
int mcls[maxn][maxK];
int kcnt[maxn];
int col[maxn];
int dis[maxn];
class FromKey {
public: 
    int rt, kp, dis;
    /*
        wut is the root
        the order of the keypoint
        distance
    */
    FromKey(int rt = 0, int kp = 0, int dis = 0) : rt(rt), kp(kp), dis(dis) {}
};
vector<FromKey> kdis[maxn];
void FindKey(int u, int fa, int rt) {
    bool flag = false;
    for(int v : G[u]) {
        if(col[v] == rt) {
            flag = true;
            break;
        }
    }
    if(flag) keyp[rt][kcnt[rt]++] = u;
    for(int v : T[u]) {
        if(v == fa || vis[v]) continue;
        FindKey(v, u, rt);
    }
}
void Color(int u, int fa, int c) {
    col[u] = c;
    siz[u] = 1;
    for(int v : T[u]) {
        if(v == fa || vis[v]) continue;
        Color(v, u, c);
        siz[u] += siz[v];
    }
}
void SetVal(int u, int fa, int val) {
    dis[u] = val;
    for(int v : T[u]) {
        if(v == fa || vis[v]) continue;
        SetVal(v, u, val);
    }
}
void Bfs(int rt, int ord) {
    queue<int> q;
    q.emplace(keyp[rt][ord]);
    dis[keyp[rt][ord]] = 0;
    while(!q.empty()) {
        int u = q.front();q.pop();
        kdis[u].emplace_back(rt, ord, dis[u]);
        for(int v : G[u]) {
            if(col[v] != rt || dis[v] <= dis[u] + 1) continue;
            dis[v] = dis[u] + 1;
            q.emplace(v);
        }
    }
}
void TreeCut(int rt) {
    col[rt] = rt;
    keyp[rt][kcnt[rt]++] = rt;
    for(int v : T[rt]) {
        if(vis[v]) continue;
        FindKey(v, rt, rt);
        Color(v, rt, rt); 
    } 
    for(int i = 0; i < kcnt[rt]; i++) {
        SetVal(rt, 0, inf);
        Bfs(rt, i);
        mcls[rt][i] = inf;
    }
    vis[rt] = true;
    for(int v : T[rt]) {
        if(vis[v]) continue;
        totsize = siz[v];
        TreeCut(FindRt(v, 0));
    } 
}
void Init() {
    MakeTree(1);
    memset(vis, 0, sizeof(vis));
    totsize = n;
    TreeCut(FindRt(1, 0));
}
void Modify(int u) {
    for(auto cur : kdis[u]) {
        int rt = cur.rt, ord = cur.kp, dis = cur.dis;
        mcls[rt][ord] = min(mcls[rt][ord], dis);
    }
}
int Query(int u) {
    int res = inf;
    for(auto cur : kdis[u]) {
        int rt = cur.rt, ord = cur.kp, dis = cur.dis;
        res = min(res, mcls[rt][ord] + dis);
    }
    return res;
}
int main() {
    cin >> n >> m >> K;
    for(int i = 1, u, v; i <= m; i++) {
        cin >> u >> v;
        G[u].emplace_back(v), G[v].emplace_back(u);
    }
    Init();
    cin >> q;
    for(int i = 1; i <= q; i++) {
        int op, u;
        cin >> op >> u;
        if(op == 1) {
            Modify(u);
        } else {
            cout << Query(u) << '\n';
        }
    }
}