#include <fstream>
#include <algorithm>
#include <vector>
#include <bitset>
using namespace std;
ifstream fin ("radiatie.in");
ofstream fout("radiatie.out");
int n,m,Q,i,j,nr,T[15003],D[15003],nivel[15001],r,x,y,maxim;
struct elem
{
    int x,y,cost;
}V[30003];
vector < pair<int,int> > A[30003];
bool cmp(elem a,elem b){ return a.cost<b.cost;}
int get_root(int x)
{
    while(T[x]>0)
        x=T[x];
    return x;
}
void join(int x,int y)
{
    int root_a=get_root(x);
    int root_b=get_root(y);
    if(root_a==root_b)
        return;
    if(T[root_a]>T[root_b])
        swap(root_a,root_b);
    T[root_a]+=T[root_b];
    T[root_b]=root_a;
}
bool query(int x, int y){ return get_root(x)!=get_root(y);}
void dfs(int x,int niv)
{
    nivel[x]=niv;
    for(int j=0;j<A[x].size();j++)
    {
        int vecin=A[x][j].first;
        int cost=A[x][j].second;
        if(!nivel[vecin])
        {
            D[vecin]=cost;
            T[vecin]=x;
            dfs(vecin,niv+1);
        }
    }
}
void check(int x,int y)
{
    while(nivel[x]>nivel[y])
    {
        maxim=max(maxim,D[x]);
        x=T[x];
    }
}
int main()
{
    fin>>n>>m>>Q;
    for(i=1;i<=m;i++)
        fin>>V[i].x>>V[i].y>>V[i].cost;
    for(i=1;i<=n;i++)
        T[i]=-1;
    sort(V+1,V+m+1,cmp);
    for(i=1;i<=m;i++)
    {
        if(query(V[i].x,V[i].y))
        {
            join(V[i].x,V[i].y);
            nr++;
            A[V[i].x].push_back({V[i].y,V[i].cost});
            A[V[i].y].push_back({V[i].x,V[i].cost});
            if(nr==n-1)
                break;
        }
    }
    for(i=1;i<=n;i++)
        if(T[i]<0)
        {
            r=i;
            break;
        }
    dfs(r,1);
    T[r]=0;
    D[r]=0;
    for(i=1;i<=Q;i++)
    {
        fin>>x>>y;
        maxim=0;
        check(x,y);
        check(y,x);
        while(x!=y)
        {
            maxim=max(maxim,max(D[x],D[y]));
            x=T[x];
            y=T[y];
        }
        fout<<maxim<<"\n";
    }
    return 0;
}