#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll> pii;
const int maxn = 1e4 + 5;
int n, m;
#define _ << " "<<
vector<pii> G[maxn];

int vis[maxn];
ll dis[maxn];

struct L_B {
    ll d[61],p[61];
    ll cnt,zero;
    L_B() {
        memset(d,0,sizeof(d));
        memset(p,0,sizeof(p));
        cnt = zero = 0;
    }
    void ins(ll val) {
        // cout << "INs" _ bitset<4>(val) << endl;
        for (int i = 60;i >= 0; --i) {
            if (val & (1ll<<i)) {
                if (!d[i]) {
                    d[i] = val;
                    cnt++;
                    return;
                }
                val ^= d[i];
            }
        }
        zero = 1;
    }

    ll query_min(ll x) {
        ll ret = x;
        for (int i = 60;i >= 0;--i) {
            if ((ret ^ d[i]) < ret) ret ^= d[i];
        }
        return ret;
    }
};

L_B base;

void dfs(int x,int fa,ll sum) {
    dis[x] = sum;
    vis[x] = 1;
    for (auto [v,len] :G[x]) {
        if (!vis[v]) dfs(v, x, sum^len);
        else if (v != fa) {
            // cout << x _ v _ (sum^len^dis[v]) << endl;
            base.ins(sum^len^dis[v]);
        }
    }
}

int main() {
    #ifdef LLOCAL
    freopen("a.in", "r", stdin);
    #endif
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin >> n >> m >> q;
    for (int i = 1;i <= m; ++i) {
        int x,y; ll c; cin >> x >> y >> c;
        G[x].push_back({y,c});
        G[y].push_back({x,c});
    }
    dfs(1, 0, 0);
    while (q--) {
        int x,y;cin >> x >> y;
        ll ans = dis[x] ^ dis[y];
        cout << base.query_min(ans) << '\n';
    }
    return 0;
}