#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define Gondozu ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using vpi = vector <pair<int, int>>;
using vvi = vector <vector<int>>;

const int OO = 1e9 + 5;
const int N = 2e5 + 5;

int curToll;
map<pi, pi> ans;
vi quer[N];
vpi edges[N];

struct DSU {
    int n, comps;
    vector<int> sz, par;
    vector<set<int>> elems;

    DSU(int n) {
        this->n = n;
        comps = n;
        sz.resize(n + 1);
        par.resize(n + 1);
        elems.resize(n + 1);
        for (int i = 1; i <= n; ++i) {
            sz[i] = 1;
            par[i] = i;
            elems[i].insert(i);
        }
    }

    int find(int x) {
        if (par[x] == x) return x;
        return par[x] = find(par[x]);
    }

    bool unite(int a, int b) {
        a = find(a), b = find(b);
        if (a == b) return false;
        if (sz[a] < sz[b]) swap(a, b);

        for(int x : elems[b]){
            for(int q : quer[x]){
                if(elems[a].count(q))
                    ans[{min(x,q), max(x,q)}] = {curToll, sz[a]+sz[b]};
            }
        }

        for(int x : elems[b]) elems[a].insert(x);
        par[b] = a;
        sz[a] += sz[b];
        comps--;
        return true;
    }
};

void TC()
{
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 0; i < m; ++i) {
        int a,b,t;
        cin >> a >> b >> t;
        edges[t].emplace_back(a,b);
    }

    pi queries[q];
    for (int i = 0; i < q; ++i) {
        cin >> queries[i].F >> queries[i].S;
        quer[queries[i].F].pb(queries[i].S);
        quer[queries[i].S].pb(queries[i].F);
        if(queries[i].F > queries[i].S)
            swap(queries[i].F, queries[i].S);
    }

    DSU dsu(n);
    while (curToll < N){
        for(pi e :edges[curToll])
            dsu.unite(e.F, e.S);
        ++curToll;
    }

    for (int i = 0; i < q; ++i) {
        pi a = ans[{queries[i].F, queries[i].S}];
        cout << a.F << ' ' << a.S << '\n';
    }
}

int32_t main() {

    Gondozu
    int t = 1;
//    cin >> t;
    while (t--) {
        TC();
        cout << '\n';
    }
    return 0;
}