#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 2e5 + 5;

bool vis[N];
int solA[N], solB[N];
vector<pair<int, int>> curQueries;
vector<pair<int, int>> queries[N];

struct DSU {
    vector<int> sz, par;
    vector<set<int>> comp;

    DSU() {
        sz.resize(N);
        par.resize(N);
        comp.resize(N);

        for (int i = 0; i < N; i++)
            par[i] = i, sz[i] = 1, comp[i].insert(i);
    }

    int findSet(int u) {
        if (u == par[u])
            return u;

        return par[u] = findSet(par[u]);
    }

    void unionSet(int u, int v, int c) {
        u = findSet(u);
        v = findSet(v);

        if (u != v) {
            if (sz[u] < sz[v])
                swap(u, v);

            par[v] = u;
            sz[u] += sz[v];

            for (auto &w: comp[v]) {
                comp[u].insert(w);

                for (auto &i: queries[w]) {
                    if (vis[i.first] || comp[u].find(i.second) == comp[u].end())
                        continue;

                    vis[i.first] = 1, solA[i.first] = c;
                    curQueries.emplace_back(i.first, w);
                }
            }
        }
    }
} dsu;

struct Edge {
    int u, v, c;

    bool operator < (Edge &e) const {
        return c < e.c;
    }
};

void testCase() {
    int n, m, q;
    cin >> n >> m >> q;

    vector<Edge> edges(m);
    for (int i = 0; i < m; i++)
        cin >> edges[i].u >> edges[i].v >> edges[i].c;

    sort(edges.begin(), edges.end());

    for (int i = 0; i < q; i++) {
        int u, v;
        cin >> u >> v;

        queries[u].emplace_back(i, v);
        queries[v].emplace_back(i, u);
    }

    for (int i = 0; i < m; i++) {
        dsu.unionSet(edges[i].u, edges[i].v, edges[i].c);

        if (i + 1 >= m || edges[i + 1].c != edges[i].c) {
            while (curQueries.size()) {
                solB[curQueries.back().first] = dsu.comp[dsu.findSet(curQueries.back().second)].size();

                curQueries.pop_back();
            }
        }
    }

    for (int i = 0; i < q; i++)
        cout << solA[i] << ' ' << solB[i] << el;
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}