#include <bits/stdc++.h>
#define N 15100

using namespace std;

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

struct edge{
	int x, y, c;
};

int n, m, k, x, y, xx, yy, c, vf, stk[N], p[N], d[N], dad[N];
edge edges[2 * N];
vector <pair <int, int> > v[N];
bool viz[N];

bool cmp(edge a, edge b){
	return a.c < b.c;
}

int find(int x){
	return (dad[x] == x ? x : dad[x] = find(dad[x]));
}

void join(int x, int y){
	dad[find(x)] = find(y);
}

void dfs(int tata, int nod, int lvl, int cost){
	viz[nod] = 1;
	d[nod] = lvl;
	p[nod] = cost;
	dad[nod] = tata;
	for(auto son : v[nod])
		if(!viz[son.first])
			dfs(nod, son.first, lvl + 1, son.second);
}

int lca(int x, int y){
	int mx = 0;
	if(d[x] < d[y])
		swap(x, y);
	while(d[x] > d[y]){
		mx = max(mx, p[x]);
		x = dad[x];
	}	
	while(x != y){
		mx = max({mx, p[x], p[y]});
		x = dad[x];
		y = dad[y];
	}
	return mx;
}

int main(){
	in >> n >> m >> k;
	for(int i = 1; i <= m; i++){
		in >> x >> y >> c;
		edges[i] = {x, y, c};
	}
	sort(edges + 1, edges + m + 1, cmp);
	for(int i = 1; i <= n; i++)
		dad[i] = i;
	for(int i = 1; i <= m; i++){
		x = edges[i].x;
		y = edges[i].y;
		c = edges[i].c;
		xx = find(x);
		yy = find(y);
		if(xx != yy){
			join(xx, yy);
			v[x].push_back({y, c});
			v[y].push_back({x, c});
		}
	}
	for(int i = 1; i <= n; i++)
		dad[i] = find(dad[i]);
	for(int i = 1; i <= n; i++)
		if(!viz[dad[i]]){
			viz[dad[i]] = 1;
			stk[++vf] = i;
		}
	memset(viz, 0, sizeof viz);
	for(int i = 1; i < vf; i++){
		v[i].push_back({i + 1, 0});
		v[i + 1].push_back({i, 0});
	}	
	vf = 0;
	dad[1] = 0;
	dfs(0, 1, 0, 0);
	while(k--){
		in >> x >> y;
		out << lca(x, y) << '\n';
	}
	return 0;
}