#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
using namespace std;
ifstream in("radiatie.in");
ofstream out("radiatie.out");
pair< int , pair<int,int> > edge[400002];
vector<int> c;
vector< vector< pair<int,int > > > a;
int n,m,tcost;
int group(int i)
{
    if(i==c[i])return i;
    c[i]=group(c[i]);
    return c[i];
}
void unite(int i,int j)
{
    c[group(i)]=group(j);
}
void Kruskal()
{
    for(int i=1;i<=n;i++)
        c[i]=i;
    for(int i=1,step=0;i<=m && step!=n-1;i++)
    if(group(edge[i].second.first) != group(edge[i].second.second))
    {
        unite(edge[i].second.first,edge[i].second.second);
        a[ edge[i].second.first ].pb( mp(edge[i].second.second,edge[i].first) );
        a[ edge[i].second.second ].pb( mp(edge[i].second.first,edge[i].first) );
        step++;
    }
}
vector<int> p,eul,lvl,tree;
vector< pair<int,int> > t;
int k;
void dfs(int x,int level,int f)
{
    lvl[++k]=level;
    eul[k]=x;
    p[x]=k;
    for(vector< pair<int,int> >::iterator i=a[x].begin();i!=a[x].end();i++)
    if(p[i->first]==0)
    {
        dfs(i->first,level+1,x);
        t[i->first]=mp(x,i->second);
        lvl[++k]=level;
        eul[k]=x;
    }
}
void update(int x,int left,int right)
{
    if(left==right)
        tree[x]=left;
    else{
        int mid=(left+right)/2;
        update(2*x,left,mid);
        update(2*x+1,mid+1,right);
        tree[x]=(lvl[ tree[2*x] ] > lvl[ tree[2*x+1] ] ? tree[2*x+1] : tree[2*x]);
    }
}
int sol,q;
void query(int x,int left,int right,int a,int b)
{
    if(a<=left && b>=right)
        sol= (lvl[ sol ] > lvl[ tree[x] ] ? tree[x] : sol);
    else{
        int mid=(left+right)/2;
        if(a<=mid)
            query(2*x,left,mid,a,b);
        if(b>mid)
            query(2*x+1,mid+1,right,a,b);
    }
}
int LCA(int x,int y)
{
    sol=0;
    x=p[x];
    y=p[y];
    if(x>y)
        swap(x,y);
    query(1,1,k,x,y);
    return eul[sol];
}
int solve(int x,int y)
{
    int sol=-INF,z=LCA(x,y);
    for(int i=x;i!=z;i=t[i].first)
        sol=max(sol,t[i].second);
    for(int i=y;i!=z;i=t[i].first)
        sol=max(sol,t[i].second);
    return sol;
}
int main()
{
    in>>n>>m>>q;
    a=vector< vector< pair<int,int> > > (n+1);
    p=vector<int> (n+1);
    t=vector< pair<int,int> > (n+1);
    lvl=eul=vector<int> (2*n+2);
    for(int i=1;i<=m;i++)
        in>>edge[i].second.first>>edge[i].second.second>>edge[i].first;
    c=vector<int> (n+1);
    sort(edge+1,edge+m+1);
    Kruskal();
    dfs(1,1,1);
    tree=vector<int> (4*k+1);
    update(1,1,k);
    lvl[0]=INF;
    for(;q;q--)
    {
        int x,y;
        in>>x>>y;
        out<<solve(x,y)  <<'\n';
    }
    return 0;
}