#include <bits/stdc++.h>

using namespace std;
ifstream fin("radiatie.in");
ofstream fout("radiatie.out");
int n, m, k, d[15005];
vector< pair<int, int> > G[15005];
queue<int> q;
void Init()
{
    for(int i = 1;i <= n;i++)
        d[i] = 2e9;
}
void F(int x)
{
    int nod, cost;
    q.push(x);
    d[x] = 0;
    while(!q.empty())
    {
        x = q.front();
        q.pop();
        for(auto e : G[x])
        {
            nod = e.first;
            cost = e.second;
            if(d[nod] > max(d[x], cost))
            {
                d[nod] = max(d[x], cost);
                q.push(nod);
            }
        }
    }
}

int main()
{
    int i, j, c;
    fin >> n >> m >> k;
    while(m)
    {
        fin >> i >> j >> c;
        G[i].push_back({j, c});
        G[j].push_back({i, c});
        m--;
    }
    while(k)
    {
        fin >> i >> j;
        Init();
        F(i);
        fout << d[j] << "\n";
        k--;
    }
    fout.close();
    return 0;
}