/*
On your knees before Isis enthroned!
Bow your head before Isis enthroned!
Interitus dei - Isis enthroned 
luati si ascultati
*/
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
FILE *in,*out;
typedef pair<int,int> ii;
vector<pair<int,ii> > a;
int b[15005],cost[15005],h[15005],nr[15005];
int rep(int x)
{
	if (b[x]==x)
		return x;
	return rep(b[x]);
}
 void adauga(pair<int,ii> muchie,int r1,int r2)
{
	if (nr[r1]>nr[r2])
	{
		nr[r1]+=nr[r2];
		b[r2]=r1;
		cost[r2]=muchie.fs;
	}
	else
	{
		nr[r2]+=nr[r1];
		b[r1]=r2;
		cost[r1]=muchie.fs;
	}
}
int search(int x,int y)
{
	int rez=0;
	while (h[x]>h[y])
	{
		rez=max(rez,cost[x]);
		x=b[x];
	}
	while (h[y]>h[x])
	{
		rez=max(rez,cost[y]);
		y=b[y];
	}
	while (x!=y)
	{
		rez=max(rez,max(cost[x],cost[y]));
		x=b[x];
		y=b[x];
	}
	return rez;
}
int main()
{
	int n,m,k,i,x,y,z;
	in=fopen("radiatie.in","r");
	out=fopen("radiatie.out","w");
	fscanf(in,"%d%d%d",&n,&m,&k);
	printf("%d\n",k);
	FOR(i,1,m)
	{
		fscanf(in,"%d%d%d",&x,&y,&z);
		a.pb(mp(z,mp(x,y)));
	}
	FOR(i,1,n)
	{
		b[i]=i;
		nr[i]=1;
	}
	sort(all(a));
	FOR(i,0,m)
	{
		int r1=rep(a[i].ss.fs),r2=rep(a[i].ss.ss);
		if (r1!=r2)
			adauga(a[i],r1,r2);
	}
	FOR(i,1,n)
		for(x=i;b[x]!=x;x=b[x]) 
			h[i]++;
	FOR(i,1,k)
	{
		fscanf(in,"%d%d",&x,&y);
		fprintf(out,"%d\n",search(x,y));
	}
	fclose(in);
	fclose(out);
	return 0;
}