#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("radiatie.in");
ofstream g("radiatie.out");

const int nlim=30005;
int n,m,k,rg[nlim],tt[nlim],nivel[nlim],varf,cost[nlim];
vector <int> lv[nlim];

struct muchii
{
    int a,b,c;
}v[nlim];

int cmp(muchii a, muchii b)
{
    return a.c<b.c;
}

void unire(int x, int y, int i)
{
    if(rg[x]<rg[y])
    {
        tt[x]=y;
        lv[y].push_back(x);
        varf=y;
        cost[x]=v[i].c;
    }

    if(rg[x]>rg[y])
    {
        tt[y]=x;
        lv[x].push_back(y);
        varf=x;
        cost[y]=v[i].c;
    }

    if(rg[x]==rg[y])
    {
        tt[x]=y;
        rg[y]++;
        lv[y].push_back(x);
        varf=y;
        cost[x]=v[i].c;
    }
}

int tata(int x)
{
    while(tt[x]!=0)
        x=tt[x];
    return x;
}

void kruskal()
{
    for(int i=1;i<=m;i++)
    {
        int tata_x=tata(v[i].a);
        int tata_y=tata(v[i].b);
        if(tata_x!=tata_y)
            unire(tata_x,tata_y,i);
    }
}

void DFS(int nod)
{
    for(int i=0;i<lv[nod].size();i++)
    {
        int vecin=lv[nod][i];
        nivel[vecin]=nivel[nod]+1;
        DFS(vecin);
    }
}

int lca(int x, int y)
{
    int cmax=0;
    while(nivel[x]>nivel[y])
    {
        cmax=max(cost[x],cmax);
        x=tt[x];
    }
    while(x!=y)
    {
        cmax=max(cmax,max(cost[x],cost[y]));
        x=tt[x];
        y=tt[y];
    }
    return cmax;
}

void citire()
{
    f>>n>>m>>k;
    for(int i=1;i<=m;i++)
        f>>v[i].a>>v[i].b>>v[i].c;
    sort(v+1,v+m+1,cmp);
    kruskal();
    DFS(varf);
    int x,y;
    for(int i=1;i<=k;i++)
    {
        f>>x>>y;
        if(nivel[x]<nivel[y])
            g<<lca(y,x)<<'\n';
        else g<<lca(x,y)<<'\n';
    }
}

int main()
{
    citire();
    return 0;
}