#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e4 + 5, maxm = 3e4 + 5;
struct Edge {
    int u, v, w;

    bool operator < (const Edge &b) const {
        return w < b.w;
    }
} e[maxm];
int n, m, q, f[maxn], fa[maxn], val[maxn], cnt;
bool vis[maxn];

void init() {
    cnt = n;
    for (int i = 1; i <= n * 2 - 1; i++) f[i] = fa[i] = i;
}
int find(int x) {
    return x == f[x] ? x : f[x] = find(f[x]);
}
void kruskal() {
    init();
    for (int i = 0; i < m; i++) {
        int u = e[i].u, v = e[i].v;
        if (find(u) != find(v)) {
            f[find(u)] = f[find(v)] = fa[find(u)] = fa[find(v)] = ++cnt;
            val[cnt] = e[i].w;
        }
    }
    assert(cnt == 2 * n -1);
}

int main() {
    scanf("%d%d%d", &n, &m, &q);
    init();
    for (int i = 0; i < m; i++)
        scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w);
    sort(e, e+m);
    kruskal();
    while (q--) {
        int x, y;
        scanf("%d%d", &x, &y);
        // 因为数据范围不大，所以就暴力求LCA了
        memset(vis, 0, sizeof(bool) * 2 * n);
        while (!vis[x]) vis[x] = true, x = fa[x];
        while (!vis[y]) y = fa[y];
        printf("%d\n", val[y]);
    }
    return 0;
}