#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int vst[301010], flag, d[301010], root[301010];
int find(int u) {
  if (u == root[u]) return u;
  return root[u] = find(root[u]);
}
vector<int> adj[301010];
int dfs(int u, int id, int &d) {
  vst[u] = flag;
  root[u] = id;
  int mx[2] = {
      0,
  };
  for (int i = 0; i < adj[u].size(); i++) {
    int v = adj[u][i];
    if (vst[v] == flag) continue;
    smax(mx[1], dfs(v, id, d) + 1);
    if (mx[1] > mx[0]) swap(mx[0], mx[1]);
  }
  smax(d, mx[0] + mx[1]);
  return mx[0];
}
int main() {
  int n, m, q, u, v;
  gn(n, m, q);
  for (int i = 0; i < m; i++) {
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i <= n; i++)
    if (!vst[i]) {
      ++flag;
      dfs(i, i, d[i]);
    }
  int t;
  while (q--) {
    gn(t);
    if (t == 1) {
      gn(u);
      println(d[find(u)]);
    } else {
      gn(u, v);
      u = find(u);
      v = find(v);
      if (u == v) continue;
      d[u] = max(max(d[u], d[v]), (d[u] + 1 >> 1) + (d[v] + 1 >> 1) + 1);
      root[v] = u;
    }
  }
  return 0;
}
