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

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

int n, m, k, d[15003];
set < pair<int, int> > g[15003];

void BFS(int x, int y)
{
    queue <int> q;
    int i;
	for (i = 1; i <= n; i++)
		d[i] = 2e9;
	d[x] = 0;
	q.push(x);
	while (!q.empty())
	{
		i = q.front();
		q.pop();
		for (auto j : g[i])
			if (d[j.first] > max(d[i], j.second))
			{
				d[j.first] = max(d[i], j.second);
				q.push(j.first);
			}
	}
	fout << d[y] << "\n";
}

int main()
{
    int i, x, y, c;
    fin >> n >> m >> k;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> c;
        g[x].insert({y, c});
        g[y].insert({x, c});
    }
    for (i = 1; i <= k; i++)
    {
		fin >> x >> y;
		BFS(x, y);
    }
    return 0;
}