N,K,Q = map(int,input().split())
sousa = []
for _ in range(K):
    a,b = map(int,input().split())
    sousa.append((a-1,b-1))
query = []
right = []
left = []
base = 20
mask = (1 << base) - 1
for _ in range(Q):
    l,r,x = map(int,input().split())
    r -= 1
    l -= 1
    x -= 1
    #query.append((l-1,r-1,x-1))
    right.append((r << (2 * base)) | (x << base) | _)
    left.append((l << (2 * base)) | (x << base) | _)
right.sort()
left.sort()

P = list(range(N))
inv = list(range(N))
now = 0
sub = [0] * Q
for u in right:
    i = u & mask
    u >>= base
    x = u & mask
    r = u >> base
    while now <= r:
        a,b = sousa[now]
        P[a],P[b] = P[b],P[a]
        now += 1
    sub[i] = P[x]
P = list(range(N))
inv = list(range(N))
now = 0
ans = [0] * Q
for u in left:
    i = u & mask
    u >>= base
    x = u & mask
    l = u >> base
    while now < l:
        a,b = sousa[now]
        inv[P[a]] = b
        inv[P[b]] = a
        P[a],P[b] = P[b],P[a]
        now += 1
    ans[i] = inv[sub[i]] + 1
for a in ans:
    print(a)