/// Msaa el 5ra
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include "bits/stdc++.h"

using namespace std;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair(x,y)
#define popCnt(x) (__builtin_popcountll(x))
#define int ll

using ll = long long;
using ii = pair<int, int>;
using ull = unsigned long long;

const int N = 2e5 + 5, LG = 18, MOD = 1e9 + 7;
const long double PI = acos(-1);
const long double EPS = 1e-7;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};

int p[N], sz[N];

int get(int i) { return i == p[i] ? i : p[i] = get(p[i]); }

void mrg(int u, int v) {
    u = get(u);
    v = get(v);
    if (sz[u] > sz[v])swap(u, v);
    p[u] = v;
    sz[v] += sz[u];
}

int lo[N], hi[N];
vector<int> qr[2][N];
vector<ii> edges[N];
int a[N], b[N];

int getMid(int i) {
    return lo[i] + (hi[i] - lo[i]) / 2;
}

int ans1[N], ans2[N];

void doWork() {

    int n, m, q;
    cin >> n >> m >> q;
    f(i, 0, m) {
        int u, v, w;
        cin >> u >> v >> w;
        edges[w].push_back({u, v});
    }
    f(i, 0, q) {
        cin >> a[i] >> b[i];
        lo[i] = 0, hi[i] = 200000;
        qr[0][getMid(i)].push_back(i);
    }

    f(i, 0, 18) {
        f(j, 1, n + 1)p[j] = j, sz[j] = 1;
        f(j, 0, N) {
            for (auto [u, v]: edges[j])mrg(u, v);
            for (auto k: qr[i & 1][j]) {
                int u = a[k];
                int v = b[k];
                if (get(u) == get(v)) {
                    hi[k] = j - 1;
                    ans1[k] = j;
                    ans2[k] = sz[get(u)];
                } else {
                    lo[k] = j + 1;
                }
                qr[i & 1 ^ 1][getMid(k)].push_back(k);
            }
            qr[i & 1][j].clear();
        }
    }
    f(i, 0, q) cout << ans1[i] << ' ' << ans2[i] << '\n';
}

int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }
}