import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 9


class SegTree(object):
    def __init__(self, N, op_data, u_data):
        self._n = N
        self.log = (N-1).bit_length()
        self.size = 1 << self.log

        self.op = op_data
        self.e = u_data

        self.data = [u_data] * (2 * self.size)
        # self.len = [1] * (2 * self.size)

    def _update(self, i):
        self.data[i] = self.op(self.data[i << 1], self.data[i << 1 | 1])

    def initialize(self, arr=None):
        """ segtreeをarrで初期化する。len(arr) == Nにすること """
        if arr:
            for i, a in enumerate(arr, self.size):
                self.data[i] = a
        for i in reversed(range(1, self.size)):
            self._update(i)
            # self.len[i] = self.len[i << 1] + self.len[i << 1 | 1]

    def update(self, p, x):
        """ data[p] = x とする (0-indexed)"""
        p += self.size
        self.data[p] = x
        for i in range(1, self.log + 1):
            self._update(p >> i)

    def get(self, p):
        """ data[p]を返す """
        return self.data[p + self.size]

    def prod(self, l, r):
        """
        op_data(data[l], data[l+1], ..., data[r-1])を返す (0-indexed)
        """
        sml = self.e
        smr = self.e
        l += self.size
        r += self.size

        while l < r:
            if l & 1:
                sml = self.op(sml, self.data[l])
                l += 1
            if r & 1:
                r -= 1
                smr = self.op(self.data[r], smr)
            l >>= 1
            r >>= 1
        return self.op(sml, smr)

    def all_prod(self):
        """ op(data[0], data[1], ... data[N-1])を返す """
        return self.data[1]

    def max_right(self, l, func):
        """
        func(l, l+1, ..., r-1) = True,
        func(l, l+1, ..., r-1, r) = Falseとなる r を返す
        """
        if l == self._n:
            return self._n
        l += self.size
        sm = self.e
        while True:
            while l % 2 == 0:
                l >>= 1
            if not func(self.op(sm, self.data[l])):
                while l < self.size:
                    l <<= 1
                    if func(self.op(sm, self.data[l])):
                        sm = self.op(sm, self.data[l])
                        l += 1
                return l - self.size
            sm = self.op(sm, self.data[l])
            l += 1
            if (l & -l) == l:
                break
        return self._n

    def min_left(self, r, func):
        """
        func(     l, l+1, ..., r-1) = True,
        func(l-1, l, l+1, ..., r-1) = Falseとなる l を返す
        """
        if r == 0:
            return 0
        r += self.size
        sm = self.e
        while True:
            r -= 1
            while r > 1 and r & 1:
                r >>= 1
            if not func(self.op(self.data[r], sm)):
                while r < self.size:
                    r = r << 1 | 1
                    if func(self.op(self.data[r], sm)):
                        sm = self.op(self.data[r], sm)
                        r -= 1
                return r + 1 - self.size
            sm = self.op(self.data[r], sm)
            if (r & -r) == r:
                break
        return 0


N, K, Q = map(int, input().split())
D = N.bit_length()
C = list(map(int, input().split()))
A = list(map(lambda x: int(x)-1, input().split()))
G = [[] for _ in range(N)]
parent = [[0] * N for _ in range(D)]
for _ in range(N-1):
    e, f = map(int, input().split())
    e -= 1
    f -= 1
    G[f].append(e)
    parent[0][e] = f

for i in range(D-1):
    for j in range(N):
        parent[i+1][j] = parent[i][parent[i][j]]


def lowest_ancestor(x, h):
    for d in reversed(range(D)):
        if h >= (1 << d):
            x = parent[d][x]
            h -= (1 << d)
    return x


timer = 0
d = -1
depth = [0] * N
tour = [0] * (2 * N)
t_in = [0] * N
que = [~0, 0]
while que:
    s = que.pop()
    if s >= 0:
        d += 1
        t_in[s] = timer
        tour[timer] = d
        timer += 1
        for t in G[s]:
            que.append(~t)
            que.append(t)
            C[t] = max(C[t], C[s])
            depth[t] = depth[s] + 1
    else:
        s = ~s
        d -= 1
        tour[timer] = d
        timer += 1


atoi = [-1] * K
for i in range(K):
    atoi[i] = t_in[A[i]]

left = SegTree(K, min, inf)
right = SegTree(K, max, -inf)
seg = SegTree(2*N, min, inf)
left.initialize(atoi)
right.initialize(atoi)
seg.initialize(tour)

for _ in range(Q):
    flag, x, y = map(int, input().split())
    x -= 1
    y -= 1
    if flag == 1:
        # A[x] -> y
        A[x] = y
        atoi[x] = t_in[y]
        left.update(x, t_in[y])
        right.update(x, t_in[y])
    else:
        L = left.prod(x, y+1)
        R = right.prod(x, y+1)
        H = seg.prod(L, R+1)
        m = lowest_ancestor(A[x], depth[A[x]] - H)
        print(C[m])