// Include
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

// Definitii
#define mp make_pair
#define pb push_back

#define edge pair<int, pair<int, int> >
#define cost first
#define from second.first
#define to second.second

#define edg pair<int, int>

// Constante
const int sz = (int)15e3+1;

// Functii
int getRoot(int node);
void dfs(int node, int stop, int length);
#define node second

// Variabile
ifstream in("radiatie.in");
ofstream out("radiatie.out");

bool found;
int nodes, edges, questions;

bool visited[sz];
int root[sz];

vector<edg> graph[sz];
priority_queue< edge, vector<edge>, greater<edge> > heap;

// Main
int main()
{
	in >> nodes >> edges >> questions;
	
	int rFrom, rTo, rCost;
	while(edges--)
	{
		in >> rFrom >> rTo >> rCost;
		heap.push(mp(rCost, mp(rFrom, rTo)));
	}
	
	while(!heap.empty())
	{
		edge current = heap.top();
		heap.pop();
		
		int node1 = current.from;
		int node2 = current.to;
		
		int root1 = getRoot(node1);
		int root2 = getRoot(node2);
		
		if(root1 == root2)
			continue;
		
		root[root2] = root1;
		
		graph[node1].pb(mp(current.cost, node2));
		graph[node2].pb(mp(current.cost, node1));
	}
	
	
	int node1, node2;
	while(questions--)
	{
		memset(visited, false, sizeof(visited));
		in >> node1 >> node2;
		
		found = false;
		dfs(node1, node2, 0);
	}
	
	in.close();
	out.close();
	return 0;
}

#undef node
#undef to
#define to second
void dfs(int node, int stop, int length)
{
	visited[node] = true;
	if(node == stop)
	{
		out << length << '\n';
		found = true;
		return;
	}
	
	vector<edg>::iterator it, end=graph[node].end();
	for(it=graph[node].begin() ; it!=end && !found ; ++it)
		if(!visited[it->to])
			dfs(it->to, stop, max(length, it->cost));
}


int getRoot(int node)
{	return root[node]? root[node]=getRoot(root[node]) : node;	}