// #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define debp(p) cout << p.fi << " " << p.se << endl;
#define deb3(x,y,z) cout << x << " " << y << " " << z << endl;
#define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

using hm = unordered_map<int , int>;

hm op (hm a,hm b){
    hm ret;
    hm tmp;

    fore(y , a){
        if (b.count(y.se)){
            ret[y.fi] = b[y.se];
            // if (y.fi != b[y.se]) ret[y.fi] = b[y.se];
            // else tmp[y.fi] = 0;
        }else{
            ret[y.fi] = y.se;
        }
    }

    fore(y , b){
        if (ret.count(y.fi) == 0) ret[y.fi] = y.se;
    }

    return ret;
}

hm e(){
    hm ret;

    return ret;
}

int main(){
    int n,k,q; cin>>n>>k>>q;

    segtree<hm , op , e> sg(k);

    rep(i,k){
        int a,b; cin>>a>>b;
        a--; b--;
        if (a != b){
            hm p;
            p[a] = b;
            p[b] = a;
            sg.set(i , p);
        }

    }

    vi ans(q);

    rep(i,q){
        int l,r,x; cin>>l>>r>>x;
        l--; r--; x--;

        hm tmp = sg.prod(l , r+1);

        if (tmp.count(x)){
            // show(i);
            ans[i] = tmp[x]+1;
        }else{
            ans[i] = x+1;
        }

        // if (i == 1){
        //     fore(y , tmp){
        //         deb(y.fi , y.se);

        //     }
        // }
    }

    // hm tmp = sg.prod(3,6);

    // fore(y , tmp) deb(y.fi,y.se);

    outv;



    return 0;
}