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

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

int n, m;
int d[15005];
vector<pair<int, int>> L[15005];
queue <int> q;

void BFS(int x, int y)
{
	for (int i = 1; i <= n; i++)
		d[i] = 2e9;

	d[x] = 0;
	q.push(x);
	while (!q.empty())
	{
		x = q.front();
		q.pop();
		for (auto e : L[x])
			if (d[e.first] > max(e.second, d[x]))
			{
				d[e.first] = max(e.second, d[x]);
				q.push(e.first);
			}
	}

	fout << d[y] << "\n";
}

int main()
{
	int i, j, c, q;
	fin >> n >> m >> q;
	while (m--)
	{
		fin >> i >> j >> c;
		L[j].push_back({i, c});
		L[i].push_back({j, c});
	}

	while (q--)
	{
		fin >> i >> j;
		BFS(i, j);
	}
	return 0;
}