#include <bits/stdc++.h>
using namespace std;

int n, m, k, x, y;
int TT[15005], RG[15005], lev[15005], T2[15005], cost[15005];
bool f[15005];
vector <pair <int, int> > v[15005];
struct V{
    int x, y, c;
    bool operator < (const V &aux)const{
        return c < aux.c;
    }
};
V a[30005];
inline int find(int x){
    int R;
    for(R = TT[x]; TT[R] != R ; R = TT[R]) ;
    while(x != TT[x]){
        int y = TT[x];
        TT[x] = R;
        x = y;
    }
    return TT[x];
}
inline void unire(int x, int y){
    if(RG[x] > RG[y]) TT[y] = x;
    else if(RG[y] < RG[x]) TT[x] = y;
    else{
        ++RG[y];
        TT[x] = y;
    }
}
inline void dfs(int nod){
    for(auto it : v[nod]){
        if(f[it.first]) continue ;
        f[it.first] = 1; T2[it.first] = nod;
        cost[it.first] = it.second;
        dfs(it.first);
    }
}
inline int ad(int nod){
    if(lev[nod]) return lev[nod];
    if(nod == 1) {lev[nod] = 1; return 1;}
    lev[nod] = ad(T2[nod]) + 1;
    return lev[nod];
}
int main()
{
    freopen("radiatie.in", "r", stdin);
    freopen("radiatie.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &k);
    for(int i = 1; i <= m ; ++i)
        scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].c);
    for(int i = 1;  i <= n ; ++i){
        TT[i] = i; RG[i] = 1;
    }
    sort(a + 1, a + m + 1);
    for(int i = 1; i <= m ; ++i){
        if(find(a[i].x) != find(a[i].y)){
            unire(find(a[i].x), find(a[i].y));
            v[a[i].x].push_back(make_pair(a[i].y, a[i].c));
            v[a[i].y].push_back(make_pair(a[i].x, a[i].c));
        }
    }
    f[1] = 1; T2[1] = 1; dfs(1);
    for(int i = 1; i <= n ; ++i) ad(i);
    for(int i = 1; i <= k ; ++i){
        scanf("%d%d", &x, &y);
        int Max = 0;
        while(x != y){
            if(lev[x] < lev[y]) swap(x, y);
            Max = max(Max, cost[x]);
            x = T2[x];
        }
        printf("%d\n", Max);
    }

    return 0;
}