// Author: wlzhouzhuan
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fir first
#define sec second
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define per(i, l, r) for (int i = l; i >= r; i--)
#define mset(s, t) memset(s, t, sizeof(s))
#define mcpy(s, t) memcpy(s, t, sizeof(t))
template<typename T1, typename T2> void ckmin(T1 &a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> void ckmax(T1 &a, T2 b) { if (a < b) a = b; }
int read() {
  int x = 0, f = 0; char ch = getchar();
  while (!isdigit(ch)) f |= ch == '-', ch = getchar();
  while (isdigit(ch)) x = 10 * x + ch - '0', ch = getchar();
  return f ? -x : x;
}
template<typename T> void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) print(x / 10);
  putchar(x % 10 + '0');
}
template<typename T> void print(T x, char let) {
  print(x), putchar(let);
}

const int N = 100005;

struct Edge { int to, nxt, val; } edge[N << 1];
int head[N], tot;
void add(int u, int v, int w) {
  edge[++tot] = {v, head[u], w};
  head[u] = tot;
}

int f[N], _u[N], _v[N], _w[N], mark[N], n, m, q;
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); } 

int dis[N];
void dfs1(int u, int fa) {
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    if (v == fa) continue;
    dis[v] = dis[u] ^ edge[i].val;
    dfs1(v, u);
  }
}

int d[31], sum[N][31], Xor[N];
void ins(int x) {
  per(i, 30, 0) if (x >> i & 1) {
    if (!d[i]) { d[i] = x; return ; }
    x ^= d[i];
  }
}
int main() {
  n = read(), m = read(), q = read();
  rep(i, 1, n) f[i] = i;
  rep(i, 1, m) {
    _u[i] = read(), _v[i] = read(), _w[i] = read();
    if (find(_u[i]) != find(_v[i])) {
      f[find(_u[i])] = find(_v[i]);
      add(_u[i], _v[i], _w[i]), add(_v[i], _u[i], _w[i]);
    } else mark[i] = 1;
  }
  dfs1(1, 0);
  rep(i, 1, m) {
    if (mark[i]) ins(dis[_u[i]] ^ dis[_v[i]] ^ _w[i]);
  }
  per(i, 30, 0) {
    rep(j, i + 1, 30) {
      if (d[j] >> i & 1) d[j] ^= d[i];
    }
  }
  rep(i, 1, n) {
    Xor[i] = Xor[i - 1] ^ dis[i];
    rep(j, 0, 30) {
      sum[i][j] = sum[i - 1][j] + (dis[i] >> j & 1);
    } 
  }
  while (q--) {
    int l = read(), r = read();
    int ans = (r - l) & 1 ? Xor[r] ^ Xor[l - 1] : 0;
    per(i, 30, 0) {
      int s1 = sum[r][i] - sum[l - 1][i], s2 = r - l + 1 - s1;
      if ((1ll * s1 * (s1 - 1) / 2) & 1) ans ^= d[i];
      if ((1ll * s2 * (s2 - 1) / 2) & 1) ans ^= d[i];
    }
    print(ans, '\n');
  }
  return 0;
}