#include <bits/stdc++.h>
using namespace std;
const int NMAX = 15004;
const int KMAX = 15004;

ifstream fin("radiatie.in");
ofstream fout("radiatie.out");

int n, m, k;
// vector<pair<int, int>> apm[NMAX];
int rez[KMAX];
map<int, bool> is_query[NMAX];

struct Edge
{
    int u, v, weight;
    bool operator<(Edge const &other)
    {
        return weight < other.weight;
    }
};
vector<Edge> edges;

struct DisjoinSetUnion
{
    int p[NMAX];
    int size[NMAX];
    void init()
    {
        for (int i = 1; i <= n; i++)
        {
            p[i] = i;
            size[i] = 1;
        }
    }

    int find(int v)
    {
        if (v == p[v])
        {
            return v;
        }
        return p[v] = find(p[v]);
    }

    void unite(int u, int v, int c)
    {
        int repr_u = find(u);
        int repr_v = find(v);
        if (repr_u != repr_v)
        {
            if (size[repr_v] < size[repr_u])
            {
                swap(repr_v, repr_u);
            }
        }
        p[repr_u] = repr_v;
        size[repr_v] += size[repr_u];
        if (is_query[repr_v].size() < is_query[repr_u].size())
        {
            swap(repr_v, repr_u);
        }
        for (auto query : is_query[repr_u])
        {
            if (is_query[repr_v][query.first])
            {
                rez[query.first] = c;
            }
            is_query[repr_v][query.first] = true;
        }
    }
} DSU;

void kruskal()
{
    sort(edges.begin(), edges.end());
    int edge_cnt = 0;
    DSU.init();
    for (auto edge : edges)
    {
        if (DSU.find(edge.u) != DSU.find(edge.v))
        {
            DSU.unite(edge.u, edge.v, edge.weight);
            edge_cnt++;
        }
        if (edge_cnt == n - 1)
        {
            break;
        }
    }
}

int main()
{
    fin >> n >> m >> k;
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        edges.push_back({a, b, c});
    }
    for (int i = 1; i <= k; i++)
    {
        int a, b;
        fin >> a >> b;
        is_query[a][i] = true;
        is_query[b][i] = true;
    }
    kruskal();
    for (int i = 1; i <= k; i++)
    {
        fout << rez[i] << '\n';
    }
    return 0;
}