#include <cstdio>
#include <algorithm>

using namespace std;

#define MAX_N 15005
#define MAX_M 30005

int N, M, K;
int T[MAX_N], C[MAX_N], L[MAX_N];

struct apm{int i, j, s;} S[MAX_M];
struct cmp
{
    bool operator()(const apm a, const apm b) const
    {
        return a.s < b.s;
    }
};

void citire()
{
    scanf("%d %d %d",&N, &M, &K);

    for(int i = 1; i <= M; ++i)
        scanf("%d %d %d",&S[i].i, &S[i].j, &S[i].s);
}

int find(int x)
{
    int R;
    for(R = x; R != T[R]; R = T[R]);
    return R;
}

void solve()
{
    sort(S+1, S+M+1, cmp());
    
    for(int i = 1; i <= N; ++i)
        T[i] = i;

    for(int i = 1; i <= M; ++i)
    {
        int x = find(S[i].i), y = find(S[i].j);
        if(x != y)
            T[x] = y, C[x] = S[i].s;
    }
    
    for(int i = 1; i <= N; ++i)
        for(int j = i; T[j] != j; j = T[j])
            L[i]++;

    while(K--)
    {
        int x, y, ANS = 0;
        scanf("%d %d",&x, &y);

        for(;L[x] > L[y]; x = T[x])
            ANS = max(ANS, C[x]);
        for(;L[y] > L[x]; y = T[y])
            ANS = max(ANS, C[y]);
        for(;x != y;x = T[x], y = T[y])
            ANS = max(ANS, max(C[x], C[y]));
        printf("%d\n",ANS);
    }
}

int main()
{
    freopen("radiatie.in","rt",stdin);
    freopen("radiatie.out","wt",stdout);
    citire();
    solve();
}