1 /**************************************************************
  2     Problem: 2594
  3     User: Tunix
  4     Language: C++
  5     Result: Accepted
  6     Time:21616 ms
  7     Memory:108244 kb
  8 ****************************************************************/
  9  
 10 //BZOJ 2594
 11 #include<cstdio>
 12 #include<cstdlib>
 13 #include<cstring>
 14 #include<iostream>
 15 #include<algorithm>
 16 #define rep(i,n) for(int i=0;i<n;++i)
 17 #define F(i,j,n) for(int i=j;i<=n;++i)
 18 #define D(i,j,n) for(int i=j;i>=n;--i)
 19 using namespace std;
 20  
 21 int getint(){
 22     int v=0,sign=1; char ch=getchar();
 23     while(ch<‘0‘||ch>‘9‘) {if (ch==‘-‘) sign=-1; ch=getchar();}
 24     while(ch>=‘0‘&&ch<=‘9‘) {v=v*10+ch-‘0‘; ch=getchar();}
 25     return v*=sign;
 26 }
 27 /*******************tamplate********************/
 28 const int N=1500005;
 29 struct LCT{
 30     int c[N][2],fa[N],v[N],size[N],mx[N];
 31     bool rev[N];
 32     int st[N],top;
 33     #define L c[x][0]
 34     #define R c[x][1]
 35     void Push_up(int x){
 36         mx[x]=x;
 37         if (v[mx[L]]>v[mx[x]]) mx[x]=mx[L];
 38         if (v[mx[R]]>v[mx[x]]) mx[x]=mx[R];
 39     }
 40     void Push_down(int x){
 41         if (rev[x]) rev[x]=0,rev[L]^=1,rev[R]^=1,swap(L,R);
 42     }
 43     bool not_root(int x){
 44         return c[fa[x]][0]==x || c[fa[x]][1]==x;
 45     }
 46     void rotate(int x){
 47         int y=fa[x],z=fa[y],l=c[y][1]==x,r=l^1;
 48         if (not_root(y)) c[z][c[z][1]==y]=x;
 49         fa[x]=z; fa[y]=x; fa[c[x][r]]=y;
 50         c[y][l]=c[x][r]; c[x][r]=y;
 51         Push_up(y);
 52     }
 53     void preview(int x){
 54         top=0; st[++top]=x;
 55         for(;not_root(x);x=fa[x])
 56             st[++top]=fa[x];
 57         D(i,top,1) Push_down(st[i]);
 58     }
 59     void splay(int x){
 60         int y=0;
 61         for(preview(x);not_root(x);rotate(x))
 62             not_root(y=fa[x]) ? rotate( (c[y][1]==x^c[fa[y]][1]==y ? x : y)),1 : 1;
 63         Push_up(x);
 64     }
 65     void access(int x,int las=0){
 66         for(;x;splay(x),c[x][1]=las,las=x,x=fa[x]);
 67     }
 68     void makeroot(int x){
 69         access(x),splay(x),rev[x]^=1;
 70     }
 71     void link(int x,int y){
 72         makeroot(x),fa[x]=y;
 73     }
 74     void cut(int x,int y){
 75         makeroot(x),access(y),splay(y);
 76         if (c[y][0]==x) c[y][0]=fa[x]=0;
 77     }
 78     int query(int x,int y){
 79         makeroot(x),access(y),splay(y);
 80         return mx[y];
 81     }
 82 }t;
 83 /*********************LCT***********************/
 84 int n,m,Q;
 85 struct edge{
 86     int x,y,w,id;
 87     bool d;
 88 }e[N];
 89 struct que{
 90     int x,y,k,id,ans;
 91 }q[N];
 92 bool cmp(edge a,edge b){ return a.w<b.w; }
 93 bool cmp2(edge a,edge b){ return a.x<b.x || (a.x==b.x && a.y<b.y);}
 94 bool cmp3(edge a,edge b){ return a.id<b.id; }
 95 int find(int x,int y){
 96     int l=1,r=m,mid;
 97     while(l<=r){
 98         mid=l+r>>1;
 99         if (e[mid].x<x || (e[mid].x==x && e[mid].y<y))l=mid+1;
100         else if(e[mid].x==x && e[mid].y==y) return mid;
101         else r=mid-1;
102     }
103 }
104 /********************edge&ques******************/
105 int fa[N];
106 int find(int x){ return fa[x]==x ? x : fa[x]=find(fa[x]); }
107 /********************并查集*********************/
108 int main(){
109 #ifndef ONLINE_JUDGE
110     freopen("2594.in","r",stdin);
111     freopen("2594.out","w",stdout);
112 #endif
113     n=getint(); m=getint(); Q=getint();
114     F(i,1,n) fa[i]=i;
115     F(i,1,m){
116         e[i].x=getint(); e[i].y=getint(); e[i].w=getint();
117         if (e[i].x>e[i].y) swap(e[i].x,e[i].y);
118     }
119     sort(e+1,e+m+1,cmp);//边权序
120     F(i,1,m){
121         e[i].id=i;
122         t.v[n+i]=e[i].w;
123         t.mx[n+i]=n+i;
124     }
125     sort(e+1,e+m+1,cmp2);//字典序
126     F(i,1,Q){
127         q[i].k=getint(); q[i].x=getint(); q[i].y=getint();
128         if (q[i].k==2){
129             if (q[i].x>q[i].y) swap(q[i].x,q[i].y);
130             int t=find(q[i].x,q[i].y);
131             e[t].d=1; q[i].id=e[t].id;
132             //找到每次删除的边在边权序中的位置
133         }
134     }
135     sort(e+1,e+m+1,cmp3);//边权序
136     int tot=0;
137     F(i,1,m)
138         if (!e[i].d){
139             int f1=find(e[i].x),f2=find(e[i].y);
140             if (f1!=f2){
141                 fa[f1]=f2;
142                 t.link(e[i].x,i+n); t.link(e[i].y,i+n);
143                 tot++;
144                 if (tot==n-1) break;
145             }
146         }
147     D(i,Q,1){
148         if (q[i].k==1)
149             q[i].ans=t.v[t.query(q[i].x,q[i].y)];
150         else{
151             int k=q[i].id;
152             int tmp=t.query(q[i].x,q[i].y);
153             if (e[k].w<t.v[tmp]){
154                 t.cut(e[tmp-n].x,tmp); t.cut(e[tmp-n].y,tmp);
155                 t.link(q[i].x,k+n); t.link(q[i].y,k+n);
156             }
157         }
158     }
159     F(i,1,Q) if(q[i].k==1)
160         printf("%d\n",q[i].ans);
161     return 0;
162 }