#include <fstream>
#include <queue>
using namespace std;
ifstream f("radiatie.in");
ofstream g("radiatie.out");
struct muchie
{
    int n1,n2,cost;
};
struct comp
{
    bool operator() (muchie i,muchie j)
    {
        return i.cost>j.cost;
    }
};
vector<pair<int,int> >apm[15001];
priority_queue<muchie,vector<muchie>,comp>coada;
queue<int>codita;
int n,m,nrm,tata[15001],rang[15001],k,costul[15001],radacinapr;
int radacina(int x)
{
    int r=x;
    while(r!=tata[r])r=tata[r];
    while(x!=tata[x])
    {
        int aux=tata[x];
        tata[x]=r;
        x=aux;
    }
    return r;
}
void kruskal()
{
    for(int i=1; i<=n; i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    while(!coada.empty() && nrm<n-1)
    {
        muchie mcrt=coada.top();
        coada.pop();
        int r1=radacina(mcrt.n1);
        int r2=radacina(mcrt.n2);
        if(r1!=r2)
        {
            if(rang[r1]<rang[r2])
                {tata[r1]=r2;radacinapr=r2;}
            else {tata[r2]=r1;radacinapr=r1;}
            if(rang[r1]==rang[r2])
                rang[r1]++;
            nrm++;
            apm[mcrt.n1].push_back(make_pair(mcrt.n2,mcrt.cost));
            apm[mcrt.n2].push_back(make_pair(mcrt.n1,mcrt.cost));
        }
    }
}
void bfs(int x)
{
    codita.push(x);
    tata[x]=x;
    rang[x]=1;
    while(!codita.empty())
    {
        int ncrt=codita.front();
        codita.pop();
        for(int i=0; i<apm[ncrt].size(); i++)
        {
            if(rang[apm[ncrt][i].first]==0)
            {
                rang[apm[ncrt][i].first]=rang[ncrt]+1;
                tata[apm[ncrt][i].first]=ncrt;
                codita.push(apm[ncrt][i].first);
                costul[apm[ncrt][i].first]=apm[ncrt][i].second;
            }
        }
    }
}
int main()
{
    f>>n>>m>>k;
    for(int i=1; i<=m; i++)
    {
        int a,b,c;
        f>>a>>b>>c;
        muchie x;
        x.n1=a;
        x.n2=b;
        x.cost=c;
        coada.push(x);
    }
    kruskal();
    for(int i=1; i<=n; i++)
    {
        tata[i]=0;
        rang[i]=0;
    }
    bfs(radacinapr);
    for(int i=1; i<=k; i++)
    {
        int x,y;
        int maxim=0;
        f>>x>>y;
        while(rang[x]<rang[y])
        {
            maxim=max(maxim,costul[y]);
            y=tata[y];
        }
        while(rang[x]>rang[y])
        {
            maxim=max(maxim,costul[x]);
            x=tata[x];
        }
        while(x!=y)
        {
            maxim=max(maxim,costul[x]);
            maxim=max(maxim,costul[y]);
            y=tata[y];
            x=tata[x];
        }
        g<<maxim<<'\n';
    }
    return 0;
}