using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using Pi = Pair<int, int>;
using System.Data.Common;

class Solver
{
    int[] C, max;
    List<int>[] g;
    public void Solve(Scanner sc)
    {
        int N, K, Q;
        sc.Make(out N, out K, out Q);
        C = sc.ArrInt;
        var A = sc.ArrInt;
        g = Create(N, () => new List<int>());
        max = new int[N];
        var lw = new LowestCommonAncestor(N);
        for (int i = 0; i < N-1; i++)
        {
            int e, f;
            sc.Make(out e, out f);e--;f--;
            lw.AddEdge(e, f);
            g[f].Add(e);
        }
        lw.Build();
        var seg = new SegmentTree<int>(K, N, (a, b) => (a == N) ? b : (b == N) ? a : lw.LCA(a, b));
        for (int i = 0; i < K; i++)
        {
            seg[i] = --A[i];
        }
        seg.Build();
        dfs(0);
        while (Q-- > 0)
        {
            var t = sc.Next<int>();
            if (t == 1)
            {
                int x, y;
                sc.Make(out x, out y);x--;y--;
                seg.Update(x, y);
            }
            else
            {
                int l, r;
                sc.Make(out l, out r);l--;
                Console.WriteLine(max[seg.Query(l,r)]);
            }
        }
    }
    void dfs(int i)
    {
        chmax(ref max[i], C[i]);
        foreach (var e in g[i])
        {
            max[e] = max[i];
            dfs(e);
        }
    }
}

public class SegmentTree<T>
{
    protected readonly T[] dat;
    protected readonly int sz;
    protected readonly Func<T, T, T> merge;
    protected readonly Func<T, T, T> update;
    protected readonly T id;
    private bool finished = true;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Left(int i)
        => i << 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    protected int Right(int i)
        => (i << 1) | 1;
    public T this[int i]
    {
        get { return dat[i + sz]; }
        set { finished = false; dat[i + sz] = value; }
    }

    public SegmentTree(int N, T id, Func<T, T, T> merge, Func<T, T, T> update = null)
    {
        this.sz = 1;
        while (sz < N) sz <<= 1;
        this.id = id;
        this.merge = merge;
        this.update = update ?? ((T val1, T val2) => val2);
        dat = Create(sz << 1, () => id);
    }

    public void Update(int i, T value)
    {
        i += sz;
        dat[i] = update(dat[i], value);
        while (i > 1)
        {
            i >>= 1;
            dat[i] = merge(dat[Left(i)], dat[Right(i)]);
        }
    }

    public void Build()
    {
        for (int i = sz - 1; i > 0; i--)
            dat[i] = merge(dat[Left(i)], dat[Right(i)]);
        finished = true;
    }

    public virtual T Query(int left, int right)
    {
        if (!finished) throw new Exception("You need to Execute \"Build()\"");
        T l = id, r = id;
        for (left += sz, right += sz; left < right; left >>= 1, right >>= 1)
        {
            if ((left & 1) == 1) l = merge(l, dat[left++]);
            if ((right & 1) == 1) r = merge(dat[--right], r);
        }
        return merge(l, r);
    }

    public int Find(int st, Func<T, bool> check)
    {
        var x = id;
        return Find(st, check, ref x, 1, 0, sz);
    }
    private int Find(int st, Func<T, bool> check, ref T x, int k, int l, int r)
    {
        if (l + 1 == r)
        { x = merge(x, dat[k]); return check(x) ? k - sz : -1; }
        var m = (l + r) >> 1;
        if (m <= st) return Find(st, check, ref x, Right(k), m, r);
        if (st <= l && !check(merge(x, dat[k])))
        { x = merge(x, dat[k]); return -1; }
        var xl = Find(st, check, ref x, Left(k), l, m);
        if (xl >= 0) return xl;
        return Find(st, check, ref x, Right(k), m, r);
    }
}
class LowestCommonAncestor
{
    private List<int>[] g;
    private int N, lb;
    private int[][] parent;
    private int[] depth;
    private bool finished;
    public LowestCommonAncestor(int N)
    { this.N = N; g = Create(N, () => new List<int>()); }
    public void AddEdge(int u, int v)
    {
        g[u].Add(v); g[v].Add(u);
    }
    public void Build(int root = 0)
    {
        for (lb = 31; lb >= 0; lb--)
            if ((1 & N >> lb) == 1)
                break;
        parent = Create(lb + 1, () => Create(N, () => -1));
        depth = new int[N];
        var st = new Stack<int>();
        st.Push(-1);
        st.Push(root);
        while (st.Any())
        {
            int i = st.Pop(), p = st.Pop();
            parent[0][i] = p;
            foreach (var e in g[i])
                if (e != p)
                {
                    depth[e] = depth[i] + 1;
                    st.Push(i); st.Push(e);
                }
        }
        for (var i = 1; i <= lb; i++)
            for (var j = 0; j < N; j++)
                if (parent[i - 1][j] != -1)
                {
                    parent[i][j] = parent[i - 1][parent[i - 1][j]];
                }
        finished = true;
    }
    public int LCA(int u, int v)
    {
        if (!finished) throw new Exception("You Need to Execute \"Build()\"");
        if (depth[u] > depth[v])
            swap(ref u, ref v);
        for (var i = lb; i >= 0; i--)
            if ((1 & (depth[v] - depth[u]) >> i) == 1)
                v = parent[i][v];
        if (u == v) return u;
        for (var i = lb; i >= 0; i--)
            if (parent[i][u] != parent[i][v])
            { u = parent[i][u]; v = parent[i][v]; }
        return parent[0][u];
    }
}
#region Template
public static class Template
{
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver().Solve(new Scanner());
        Console.Out.Flush();
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static int MaxElement<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}
public class Pair<T1, T2> : IComparable<Pair<T1, T2>>
{
    public T1 v1;
    public T2 v2;
    public Pair() { }
    public Pair(T1 v1, T2 v2)
    { this.v1 = v1; this.v2 = v2; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2> p)
    {
        var c = Comparer<T1>.Default.Compare(v1, p.v1);
        if (c == 0)
            c = Comparer<T2>.Default.Compare(v2, p.v2);
        return c;
    }
    public override string ToString() => $"{v1.ToString()} {v2.ToString()}";
    public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; }
}

public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>>
{
    public T3 v3;
    public Pair() : base() { }
    public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2)
    { this.v3 = v3; }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public int CompareTo(Pair<T1, T2, T3> p)
    {
        var c = base.CompareTo(p);
        if (c == 0)
            c = Comparer<T3>.Default.Compare(v3, p.v3);
        return c;
    }
    public override string ToString() => $"{base.ToString()} {v3.ToString()}";
    public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; }
}
#endregion