#include <bits/stdc++.h>

using namespace std;

ifstream f("radiatie.in");
ofstream g("radiatie.out");

int n,m,k;
int x,y;
int used[15001],nru,nivel[15001];
priority_queue <pair<int,pair<int,int>>> PQ;
vector <pair<int,int>> muchii[15001],muchii2[15001];
int rmq[30001][15],bestj[30001],prima[15001],lca[15001][15],heaviest[15001][15];
vector <int> euler;



void dfs(int nod)
{
    used[nod]=1;
    euler.push_back(nod);
    prima[nod]=euler.size();
    for(int j=1;j<=bestj[nivel[nod]];j++)
    {
        lca[nod][j]=lca[lca[nod][j-1]][j-1];
        heaviest[nod][j]=max(heaviest[nod][j-1],heaviest[lca[nod][j-1]][j-1]);
    }
    for(auto it:muchii[nod])
    {
        if(used[it.first]==0)
        {
            nivel[it.first]=nivel[nod]+1;
            lca[it.first][0]=nod;
            heaviest[it.first][0]=it.second;
            dfs(it.first);
            euler.push_back(nod);
        }
    }
}

int lowest_common_ancestor(int nod1,int nod2)
{
    int poz1=prima[nod1],poz2=prima[nod2];
    if(poz1>poz2)
        swap(poz1,poz2);
    int i1=rmq[poz1][bestj[poz2-poz1+1]],i2=rmq[poz2-(1<<(bestj[poz2-poz1+1]))+1][bestj[poz2-poz1+1]];
    if(nivel[euler[i1]]<nivel[euler[i2]])
        return euler[i1];
    else
        return euler[i2];
}

int max_path(int nod,int a)
{
    int rez=0;
    while(nod!=a)
    {
        rez=max(rez,heaviest[nod][bestj[nivel[nod]-nivel[a]]]);
        nod=lca[nod][bestj[nivel[nod]-nivel[a]]];
    }
    return rez;
}

int raspuns()
{
    int LCA=lowest_common_ancestor(x,y);
    return max(max_path(y,LCA),max_path(x,LCA));
}

int main()
{
    f>>n>>m>>k;
    for(int i=1;i<=m;i++)
    {
        int cost;
        f>>x>>y>>cost;
        muchii2[x].push_back({y,cost});
        muchii2[y].push_back({x,cost});
    }
    used[1]=nru=1;
    for(auto it:muchii2[1])
        PQ.push({-it.second,{1,it.first}});
    while(nru<n)
    {
        pair < int,pair < int,int > > muchie = PQ.top();
        muchie.first=-muchie.first;
        PQ.pop();
        if(used[muchie.second.second]==0)
        {
            muchii[muchie.second.second].push_back({muchie.second.first,muchie.first});
            muchii[muchie.second.first].push_back({muchie.second.second,muchie.first});
            used[muchie.second.second]=1;
            for(auto it:muchii2[muchie.second.second])
                if(used[it.first]==0)
                    PQ.push({-it.second,{muchie.second.second,it.first}});
            nru++;
        }
    }
    for(int i=1;i<=n;i++)
        used[i]=0;
    bestj[1]=0;
    for(int i=2;i<=30001;i++)
    {
        bestj[i]=bestj[i-1];
        if((1<<(bestj[i]+1))<=i)
            bestj[i]++;
    }
    dfs(1);
    for(int i=1;i<=n;i++)
        rmq[i][0]=i-1;
    for(int j=1;j<=bestj[euler.size()];j++)
    {
        for(int i=1;i+(1<<j)-1<=n;i++)
        {
            int i1=rmq[i][j-1],i2=rmq[i+(1<<(j-1))][j-1];
            if(nivel[euler[i1]]<nivel[euler[i2]])
                rmq[i][j]=i1;
            else
                rmq[i][j]=i2;
        }
    }
    for(int test=1;test<=k;test++)
    {
        f>>x>>y;
        g<<raspuns()<<'\n';
    }
    return 0;
}