#include <cstdio>
#include <algorithm>

using namespace std;

#define NMAX 15050
#define MMAX 30050

struct muchie {
	int x, y, c;
} M[MMAX];

int T[NMAX], L[NMAX], D[NMAX], n, m, k, i, x, y;

int ciclu (int, int), query (int, int);
void kruskal ();

int main () {
	
	freopen ("radiatie.in", "r", stdin);
	freopen ("radiatie.out", "w", stdout);
	
	scanf ("%d %d %d", &n, &m, &k);
	for (i = 1; i <= m; i++)
		scanf ("%d %d %d", &M[i].x, &M[i].y, &M[i].c);
	
	kruskal ();
	
	for (i = 1; i <= k; i++) {
		scanf ("%d %d", &x, &y);
		printf ("%d\n", query (x, y));
	}
	
	return 0;
}

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

int ciclu (int x, int y) {
	
	int a = x, b = y;
	
	while (T[x] > 0) x = T[x];
	while (T[y] > 0) y = T[y];
	
	if (x == y) return 0;
	if (-T[x] >= -T[y]) return a;
	return b;
}

void unire (int x, int y, int c) {
	
	while (T[y] > 0) y = T[y];
	while (T[x] > 0) x = T[x];
	
	T[x] += T[y], T[y] = x, D[y] = c;
}

void kruskal () {
	
	int i, a, b, c, l, rg, apm = 0;
	
	for (i = 1; i <= n; i++) T[i] = -1;
	
	sort (M + 1, M + 1 + m, cmp);
	
	for (i = 1; i <= m; i++) {
		a = M[i].x, b = M[i].y, c = M[i].c;
		
		rg = ciclu (a, b);
		
		if (rg) {
			if (rg == a) unire (a, b, c);
			else unire (b, a, c);
			
			apm++;
		}
		
		if (apm == n - 1) {
			for (i = 1; i <= n; i++) {
				a = b = i, l = 0;
				while (T[b] > 0) b = T[b], l++;
				L[a] = l;
			}
			
			return;
		}
	}
}

int query (int x, int y) {
	
	int sol = 0;
	
	if (L[x] < L[y]) swap (x, y);
	
	while (L[x] > L[y]) {
		if (D[x] > sol) sol = D[x];
		x = T[x];
	}
	
	while (x != y) {
		if (D[x] > sol) sol = D[x]; x = T[x];
		if (D[y] > sol) sol = D[y]; y = T[y];
	}
	
	return sol;
}