/// :3
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;

#include "bits/stdc++.h"

#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 = 3e5+5, LG = 18, MOD = (119 << 23) + 1;
const long double PI = acos(-1);
const long double EPS = 1e-7;
const int dx[] = {1,1,0,-1,-1,-1,0,1};
const int dy[] = {0,1,1,1,0,-1,-1,-1};
int p[10005];
int get(int i){return i == p[i]? i : p[i]=get(p[i]);}
int n, m, q;
vector<ii> adj[10004];
int xr[N];
void dfs(int node, int par) {

    for(auto e : adj[node]) if(e.F != par){
        xr[e.F] = xr[node] ^ e.S;
        dfs(e.F, node);
    }

}
struct G {
	vector<ll> setOfXors;
	void ins(ll x) {	///Add X to Gaussian Basis
		for (auto v : setOfXors)
			x = min(x, x ^ v);
		if (x)
			setOfXors.push_back(x);
	}
	ll qry(ll x) { ///Get maximum subsequence XOR ^ x
		for (auto v : setOfXors)
			x = max(x, x ^ v);
		return x;
	}
} gauss;
void doWork() {
    cin >> n >> m >> q;
    iota(p,p+n+1,0);
    vector<array<int, 3> > edges;
    while(m--) {
        int u, v, w;
        cin >> u >> v >> w;
        if(get(u) != get(v)) {
            adj[u].pb({v, w});
            adj[v].pb({u, w});
            p[get(u)] = get(v);
        }   else {
            edges.push_back({u, v, w});
        }
    }

    dfs(1, 1);

    for(auto e : edges) {
        int u = e[0], v = e[1], w = e[2];
        gauss.ins(xr[u]^xr[v]^w);
    }

    while(q--) {
        int u, v;
        cin >> u >> v;
        int val = xr[u] ^ xr[v];
        for(auto v : gauss.setOfXors)
            val = min(val, val ^ v);
        cout << val << '\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();
    }
    return 0;
}