#include<iostream>
#include<cstdio>
#include<set>
#define FIT(a,b) for(vector<unsigned int>::iterator it=b.begin();it!=b.end();it++)
#include<stack>
#define ROF(a,b,c) for(register int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(register int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define mod 1000000007
#define inf (1<<30)
#define N 300100
#define DIM 10000100
using namespace std;
/*ifstream f("a.in");
ofstream g("a.out");*/
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
struct qr{int ans,poz,a,b;} q[N];
pair<int, pair<int,int> > e[N];
int ansu,R[N],sol,t,T[N],Q,n,m,ma,po;
int dpans( qr a,qr b){ return a.ans<b.ans;}
int dppoz( qr a,qr b){ return a.poz<b.poz;}
int find(int x)
{
	int aux=x;
	while(x!=T[x])
	{
		x=T[x];
	}
	int tata=x;
	x=aux;
	while(x!=tata)
	{
		aux=T[x];
		T[x]=tata;
		x=aux;
	}
	return tata;
}
void unite(int x,int y)
{
	if(R[x]==R[y])
	{
		R[x]++;
		T[y]=x;
	}
	else
	{
		if(R[x]>R[y])
			T[y]=x;
		else
			T[x]=y;
	}
}
int main ()
{
    freopen("radiatie.in","r",stdin);
    freopen("radiatie.out","w",stdout);
	
	f>>n>>m>>Q;
	FOR(i,1,m)
	{
		f>>e[i].se.fi>>e[i].se.se>>e[i].fi;
		if(e[i].fi>ma)
			ma=e[i].fi;
	}
	sort(e+1,e+m+1);
	po=1;
	for(;po<=ma;po<<=1);

	FOR(i,1,Q)
	{
		f>>q[i].a>>q[i].b;
		q[i].poz=i;
		q[i].ans=0;
	}
	
	for(;po;po>>=1)
	{
		FOR(i,1,n)
		{
			T[i]=i;
			R[i]=0;
		}
		t=1;
		FOR(i,1,Q)
		{
			ansu=q[i].ans+po;
			while(t<=m&&e[t].fi<=ansu)
			{
				int t1=find(e[t].se.fi);
				int t2=find(e[t].se.se);
				if(t1!=t2)
					unite(t1,t2);
				t++;
			}
			int t1=find(q[i].a);
			int t2=find(q[i].b);
			if(t1!=t2)
				q[i].ans+=po;
		}
		sort(q+1,q+Q+1,dpans);
	}
	
	sort(q+1,q+Q+1,dppoz);
	
	sol=0;
	FOR(i,1,Q)
	{
		q[i].ans++;
		g<<q[i].ans<<"\n";
	}
	
    return 0;
}