#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 using namespace std;

 struct node

 {

     int x,y,c;

 }a[];int len;

 void ins(int x,int y,int c)

 {

     len++;a[len].x=x;a[len].y=y;a[len].c=c;

 }

 struct edge

 {

     int x,y,c,next;

 }e[];int llen,last[];

 void inss(int x,int y,int c)

 {

     llen++;e[llen].x=x;e[llen].y=y;e[llen].c=c;

     e[llen].next=last[x];last[x]=llen;

 }

 int fa[];

 int findfa(int x){if(fa[x]!=x)fa[x]=findfa(fa[x]);return fa[x];}

 bool cmp(node n1,node n2){return n1.c<n2.c;}

 int n,m,T;

 int bin[],dep[],f[][];

 int mx[][];//记录i~i+2^j的最大边值

 void pre_tree_node(int x)

 {

     for(int i=;i<= && dep[x]>=bin[i];i++)

         f[x][i]=f[f[x][i-]][i-],mx[x][i]=max(mx[x][i-],mx[f[x][i-]][i-]);

     for(int k=last[x];k;k=e[k].next)

     {

         int y=e[k].y;

         if(y!=f[x][])

         {

             dep[y]=dep[x]+;

             f[y][]=x;mx[y][]=e[k].c;

             pre_tree_node(y);

         }

     }

 }

 int sol(int x,int y)

 {

     int maxx=;

     if(dep[x]<dep[y])swap(x,y);

     for(int i=;i>=;i--)

         if(dep[x]-dep[y]>=bin[i])

             maxx=max(maxx,mx[x][i]),x=f[x][i];

     if(x==y)return maxx;

     for(int i=;i>=;i--)

         if(dep[x]>=bin[i] && f[x][i]!=f[y][i])

             maxx=max(maxx,max(mx[x][i],mx[y][i])),x=f[x][i],y=f[y][i];

     maxx=max(maxx,max(mx[x][],mx[y][]));

     return maxx;

 }

 int main()

 {

     bin[]=;for(int i=;i<=;i++)bin[i]=bin[i-]<<;

     scanf("%d%d%d",&n,&m,&T);

     llen=len=;memset(last,,sizeof(last));

     for(int i=;i<=m;i++)

     {

         int x,y,c;scanf("%d%d%d",&x,&y,&c);

         ins(x,y,c);ins(y,x,c);

     }

     sort(a+,a+len+,cmp);

     for(int i=;i<=n;i++)fa[i]=i;int tt=;

     for(int i=;i<=len;i++)

     {

         int fx=findfa(a[i].x),fy=findfa(a[i].y);

         if(fx!=fy)

         {

             fa[fy]=fx,tt++;

             inss(a[i].x,a[i].y,a[i].c);

             inss(a[i].y,a[i].x,a[i].c);

             if(tt==n-)break;

         }

     }

     for(int i=;i<=n;i++)

         if(fa[i]==i)

             f[i][]=,dep[i]=,pre_tree_node(i);

     while(T--)

     {

         int st,ed;scanf("%d%d",&st,&ed);

         printf("%d\n",sol(st,ed));

     }

     return ;

 }