#include <fstream>
#include <vector>
#define MAX 15001
#define INF -1
#define maxi(a, b) ((a) > (b) ? (a) : (b))

using namespace std;

int n, m, cnt = 0;
int co[MAX][MAX], p[MAX], h[MAX];
int a[MAX<<1][15], e[MAX<<1], l[MAX<<1], lg[MAX<<1], t[MAX];

vector<vector<int> > v;

struct muchie{
    int v1, v2, c;
} g[MAX];

struct Cmp{
    bool operator () (muchie a, muchie b)
    {
         return (a.c < b.c);       
    }
};

int Find(int x)
{
    if (x != p[x]) p[x] = Find(p[x]);
    return p[x];    
}

void Union(int x, int y)
{
    if (h[x] > h[y]) p[y] = p[x];
    else 
    {
        p[x] = p[y];
        if (h[x] == h[y]) h[y]++;     
    }     
}

void DF(int nod, int lvl)
{
    p[nod] = 1;
     
    e[++cnt] = nod;
    l[cnt] = lvl;
    if (!h[nod]) h[nod] = cnt;
    
    int x = v[nod].size(), i;
    for (i = 0; i < x; i++)      
        if (!p[v[nod][i]])
        {
            t[v[nod][i]] = nod;
            DF(v[nod][i], lvl+1);
            e[++cnt] = nod;
            l[cnt] = lvl;                
        }
}

int GetCMax(int x, int lca)
{
	int cmax = 0;	
	if (x == lca) return INF;
	while(x != lca)
	{
		cmax = maxi(cmax, co[t[x]][x]);
		x = t[x];
	}
	return cmax;
}

int main()
{
    int i, j, x, x1, x2, cost, T;
    
    ifstream fin("radiatie.in");
    fin >> n >> m >> T;
    
    v.resize(n+1);
    
    for (i = 1; i <= m; i++)    
    {
        fin >> x1 >> x2 >> cost;
        g[i].v1 = x1;
        g[i].v2 = x2;
        g[i].c = cost;
    }
    
    sort(g+1, g+m+1, Cmp());    
    
    for (i = 1; i <= n; i++){ p[i] = i; h[i] = 0; }
    
    for (i = 1; i <= m; i++)
    {
        x1 = Find(g[i].v1);
        x2 = Find(g[i].v2);
        if (x1 != x2)    
        {
           v[g[i].v1].push_back(g[i].v2);
           v[g[i].v2].push_back(g[i].v1);
           co[g[i].v1][g[i].v2] = co[g[i].v2][g[i].v1] = g[i].c;
           Union(x1, x2);  
        }
    }
    
    for (i = 1; i <= n; i++){ p[i] = 0; h[i] = 0; }
    
    DF(1, 1);
    
    lg[1] = 0;
    for (i = 2; i <= cnt; i++)
        lg[i] = lg[i/2] + 1;
    
    for (i = 1; i <= cnt; i++)
        a[i][0] = i;
    
    for (j = 1; (1 << j) <= cnt; j++)    
        for (i = 1; i + (1 << j) <= cnt; i++)
        {
            x = i + (1 << j);
            if (l[a[i][j-1]] < l[a[x][j-1]]) a[i][j] = a[i][j-1];  
            else                             a[i][j] = a[x][j-1];     
        }
        
    ofstream fout("radiatie.out");
    
    int lca, max1, max2;
    
    for (; T; T--)
    {
        fin >> x1 >> x2;
        x = lg[x2-x1];
        if (l[a[x1][x]] < l[a[x2-(1<<x)+1][x]]) lca = e[a[x1][x]];
        else                                    lca = e[a[x2-(1<<x)+1][x]];
        
        max1 = GetCMax(x1, lca);  
        max2 = GetCMax(x2, lca);  
        
        fout << maxi(max1, max2) << "\n";         
    }
     
    fin.close();
    fout.close();
    
    return 0;
}