func_code_string: #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;   }   const int C = 333333;   vector<int> adj[C];   int root[C], sz[C], d[C], src;   pair<int, int> f;   int find_root(int u) {     return (root[u] == u ? u : root[u] = find_root(root[u]));   }   void add(int u, int v) {     int uu = find_root(u), vv = find_root(v);     if (uu == vv) return;     sz[vv] += sz[uu];     root[uu] = vv;     smax(d[vv], max(d[uu], (1 + d[uu]) / 2 + (1 + d[vv]) / 2 + 1));   }   void dfs(int u, int dp = 0) {     root[u] = src;     sz[src]++;     if (dp > f.second) {       f.second = dp;       f.first = u;     }     for (int i = 0; i < adj[u].size(); i++) {       int v = adj[u][i];       if (root[v]) continue;       dfs(v, dp + 1);     }   }   void rdfs(int u, int dp = 0, int fa = 0) {     smax(d[src], dp);     for (int i = 0; i < adj[u].size(); i++) {       int v = adj[u][i];       if (v == fa) continue;       rdfs(v, dp + 1, u);     }   }   void solve_C() {     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 (!root[i]) {         f.first = i;         f.second = 0;         src = i;         dfs(i);         rdfs(f.first);       }     while (q--) {       int t;       gn(t);       if (t == 1) {         gn(u);         u = find_root(u);         println(d[u]);       } else {         gn(u, v);         add(u, v);       }     }     exit(0);   }   int main() {     solve_C();     return 0;   }   