#include<bits/stdc++.h>
using namespace std;
ifstream fin("heavypath.in");
ofstream fout("heavypath.out");

const int N = 1e5 + 5;
int n, q, niv[N], sz[N], path[N], numpaths, d[N], l[N], poz[N];
int *aint[N];
vector<int> v[N], paths[N];

void DFS(int tata, int nod, int nivel)
{
    int heavyson = 0;
    niv[nod] = nivel;
    sz[nod] = 1;
    for (int i : v[nod])
        if (i != tata)
        {
            DFS(nod, i, nivel + 1);
            sz[nod] += sz[i];
            if (sz[i] > sz[heavyson])
                heavyson = i;
        }
    if (heavyson == 0)
    {
        paths[++numpaths].push_back(nod);
        path[nod] = numpaths;
    }
    else
    {
        paths[path[heavyson]].push_back(nod);
        path[nod] = path[heavyson];
    }
}

void Build()
{
    for (int i = 1; i <= numpaths; i++)
    {
        reverse(paths[i].begin(), paths[i].end());
        for (int j = 0; j < paths[i].size(); j++)
            poz[paths[i][j]] = j + 1;
        for (l[i] = 1; l[i] < paths[i].size(); l[i] *= 2);
        aint[i] = new int[l[i] + 5]();
        for (int j = l[i]; j < l[i] + paths[i].size(); j++)
            aint[i][j] = paths[i][j - l[i]];
        for (int j = l[i] - 1; j >= 1; j--)
            aint[i][j] = max(aint[i][2 * j], aint[i][2 * j + 1]);
    }
}

void Update(int nod, int val)
{
    int p = poz[nod] + l[path[nod]] - 1;
    aint[path[nod]][p] = val;
    while (p > 1)
    {
        p /= 2;
        aint[path[nod]][p] = max(aint[path[nod]][2 * p], aint[path[nod]][2 * p + 1]);
    }
}

int QueryAint(int pth, int st, int dr)
{

}

int Query(int a, int b)
{

}

int main()
{
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
        fin >> d[i];
    for (int i = 1; i < n; i++)
    {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    DFS(0, 1, 1);
    Build();
    while (q--)
    {
        int op, a, b;
        fin >> op >> a >> b;
        if (op == 0)
            Update(a, b);
        if (op == 1)
            cout << Query(a, b) << '\n';
    }
    return 0;
}