#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, k, q; cin >> n >> k >> q;
  vector<int> a(k), b(k); REP(i, k) cin >> a[i] >> b[i], --a[i], --b[i];
  vector<int> l(q), r(q), x(q); REP(i, q) cin >> l[i] >> r[i] >> x[i], --l[i], --r[i], --x[i];
  vector<vector<int>> queries(k);
  REP(i, q) queries[r[i]].emplace_back(i);
  vector<int> p(n);
  iota(ALL(p), 0);
  REP(i, k) {
    swap(p[a[i]], p[b[i]]);
    // REP(i, n) cout << p[i] << " \n"[i + 1 == n];
    for (const int id : queries[i]) x[id] = p[x[id]];
  }
  // REP(i, q) cout << x[i] + 1 << " \n"[i + 1 == q];
  REP(i, k) queries[i].clear();
  REP(i, q) queries[l[i]].emplace_back(i);
  iota(ALL(p), 0);
  vector<int> inv(n);
  iota(ALL(inv), 0);
  REP(i, k) {
    for (const int id : queries[i]) x[id] = inv[x[id]];
    swap(inv[p[a[i]]], inv[p[b[i]]]);
    swap(p[a[i]], p[b[i]]);
  }
  REP(i, q) cout << x[i] + 1 << '\n';
  return 0;
}