#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define momen ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define ld long double
#define fp(n) for(int i=0;i<n;i++)
#define fp1(n) for(int i=1;i<=n;i++)
#define all(v) v.begin() , v.end()
const int mod = 1e9 + 7, N = 2e5 + 5, M = 8e6 + 5;
const ll LG = 20, inf = 1e9 + 6;


int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};


pair<int,int> anc[N][20], p[N] ;
int d[N], n, q ;
vector<pair<int ,int>> adj[N];

void dfs(int i, int par , int c)
{
    p[i] = {par ,c};
    d[i] = d[par]+1;
    for(auto e:adj[i])
    {
        if(e.first == par)
            continue;
        dfs(e.first, i , e.second);
    }
}

//need par, depth
void preprocess()
{
    // k is 2^k anc
    for(int k=0;k<LG; k++)
    {
        for(int i=1; i<=n; i++)
        {
            if(k == 0)
                anc[i][k] = p[i];
            else {
                anc[i][k].first = anc[anc[i][k - 1].first][k - 1].first;
                anc[i][k].second = max(anc[anc[i][k - 1].first][k - 1].second, anc[i][k - 1].second);
            }
        }
    }
}

pair<int ,int> binaryLift(int x, int jump)
{
    int mx  =  0 ;
    for(int b=0; b<LG; b++)
    {
        if( jump & (1 << b)) {
            mx = max(mx , anc[x][b].second ) ;
            x = anc[x][b].first;
        }
    }
    return {x, mx};
}
int LCA(int a, int b)
{
    if(d[a] > d[b])
        swap(a, b);

    // guaranteed that b is deeper
    //make same depth
    int diff = d[b] - d[a];
    int mx = 0 ;
    tie(b,mx) = binaryLift(b, diff);

    if(a == b)
        return mx;

    for(int bit=LG-1; bit>=0; bit--)
    {
        if(anc[a][bit].first==anc[b][bit].first)
            continue;
        mx = max({mx ,anc[a][bit].second , anc[b][bit].second}) ;
        a = anc[a][bit].first;
        b = anc[b][bit].first;
    }
    return mx;
}



struct DSU{
    vector<int>par ;
    vector<int>sze ;
    int mx = 1;
    DSU(int n){
        par.resize(n+1) ;
        sze.resize(n+1) ;
        fp(n+1) {
            par[i]= i ;
            sze[i]= 1;
        }
    }
    int find(int a){
        while(par[a] != a ){
            a = par[a] ;
        }
        return a;
    }
    bool unite(int a , int b ){
        a = find(a) ;
        b = find(b) ;
        if (a==b)
            return 1 ;
        if (sze[a] < sze[b])
            swap(a,b) ;
        par[b] = par[a] ;
        sze[a]+=sze[b] ;
        return 0 ;
    }
};



void solve(int z) {
    int m , q;
    cin>>n>>m>>q;
    vector<pair<int ,pair<int ,int>>> edges ;
    for (int i = 0; i < m; ++i) {
        int a,b,c ;
        cin>>a>>b>>c;
        edges.push_back({c,{a,b}}) ;
    }
    sort(all(edges)) ;
    DSU d(n+1) ;
    for (int i = 0; i < m; ++i) {
        int a ,b,c ;
        c = edges[i].first , a = edges[i].second.first , b = edges[i].second.second;
        if (d.unite(a,b))
            continue;
        adj[a].push_back({b,c}) ,adj[b].push_back({a,c}) ;
    }
    dfs(1,0,0) ;
    preprocess() ;

    vector<pair<int ,int>>qu[N] ;
    for (int i = 1; i <= q; ++i) {
        int a,b ;
        cin>>a>>b ;
        int x = LCA(a,b) ;
        qu[x].push_back({i , a}) ;
    }
    DSU d2(n+1) ;
    vector<pair<int ,int>>ans(q+1) ;
    for (int i = 0; i < m; ++i) {
        int a ,b,c ;
        c = edges[i].first , a = edges[i].second.first , b = edges[i].second.second;
        if (i && c > edges[i-1].first){
            for (int j = 0; j < qu[edges[i-1].first].size(); ++j) {
                int z = qu[edges[i-1].first][j].second ;
                int y =d2.find(z) ;
                int size = d2.sze[y] ;
                ans[qu[edges[i-1].first][j].first] = {edges[i-1].first ,size };
            }
        }
        if (d2.unite(a,b))
            continue;
    }
    for (int j = 0; j < qu[edges.back().first].size(); ++j) {
        ans[qu[edges.back().first][j].first] = {edges.back().first ,d2.sze[d2.find(qu[edges.back().first][j].second)]  };
    }

    for (int i = 1; i <=q ; ++i) {
        cout<<ans[i].first<<" "<<ans[i].second<<endl ;
    }

}


int main() {
    momen
    int t = 1;
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
//    cin >> t;

    for (int i = 1; i <= t; ++i) {
        //cout<<"Case #"<<i<<": ";
        solve(t);
    }

    return 0;
}