#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <unordered_map>
using namespace std;

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

vector <pair<int, int> > L[15005];
int dp[15005], n, m;

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

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

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