#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("heavypath.in");
ofstream fout("heavypath.out");

const int NMAX = 1e5;

int n, q;
int v[NMAX + 1];
int sz[NMAX + 1];
int parent[NMAX + 1];
int level[NMAX + 1];

int heavyChild[NMAX + 1];

vector <int> adj[NMAX + 1];

void explore(int node, int Parent){
    sz[node] = 1;

    parent[node] = Parent;
    level[node] = level[Parent] + 1;

    int maxi = 0;
    for(int child : adj[node]){
        if(child != Parent){
            explore(child, node);
            sz[node] += sz[child];

            if(sz[child] > maxi){
                maxi = sz[child];
                heavyChild[node] = child;
            }
        }
    }
}

int Id = 0;
int id[NMAX + 1];
int head[NMAX + 1];

int dfsTime = 0;
int lin[NMAX + 1];
int Time[NMAX + 1];

void heavyFirstLin(int node, int Parent){
    ++dfsTime;
    lin[dfsTime] = node;
    Time[node] = dfsTime;

    if(heavyChild[Parent] == node){
        id[node] = id[Parent];
    }else{
        id[node] = ++Id;
        head[Id] = node;
    }

    for(int child : adj[node]){
        if(child != Parent){
            heavyFirstLin(child, node);
        }
    }
}

namespace SegTree{
    int aint[4 * NMAX + 1];

    void build(int node, int left, int right){
        if(left == right){
            aint[node] = v[lin[left]];
            return;
        }

        int mij = (left + right) / 2;
        build(2 * node, left, mij);
        build(2 * node + 1, mij + 1, right);

        aint[node] = max(aint[2 * node], aint[2 * node + 1]);
    }

    void update(int node, int left, int right, int pos, int val){
        if(left == right){
            aint[node] = val;
            return;
        }

        int mij = (left + right) / 2;
        if(pos <= mij){
            update(2 * node, left, mij, pos, val);
        }else{
            update(2 * node + 1, mij + 1, right, pos, val);
        }

        aint[node] = max(aint[2 * node], aint[2 * node + 1]);
    }

    int query(int node, int left, int right, int qLeft, int qRight){
        if(qLeft <= left && right <= qRight){
            return aint[node];
        }

        int mij = (left + right) / 2;

        int ans = 0;

        if(qLeft <= mij){
            ans = max(ans, query(2 * node, left, mij, qLeft, qRight));
        }

        if(mij + 1 <= qRight){
            ans = max(ans, query(2 * node + 1, mij + 1, right, qLeft, qRight));
        }

        return ans;
    }
}

int query(int a, int b){
    int ans = 0;

    while(id[a] != id[b]){
        if(level[head[id[a]]] > level[head[id[b]]]){
            ans = max(ans, SegTree::query(1, 1, n, Time[head[id[a]]], Time[a]));
            a = parent[head[id[a]]];
        }else{
            ans = max(ans, SegTree::query(1, 1, n, Time[head[id[b]]], Time[b]));
            b = parent[head[id[b]]];
        }
    }

    ans = max(ans, SegTree::query(1, 1, n, min(Time[a], Time[b]), max(Time[a], Time[b])));

    return ans;
}

int main(){

    fin >> n >> q;

    for(int i = 1; i <= n; i++){
        fin >> v[i];
    }

    for(int i = 1; i <= n - 1; i++){
        int a, b;
        fin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    explore(1, 0);
    heavyFirstLin(1, 0);
    SegTree::build(1, 1, n);

    while(q--){
        int type, x, y;
        fin >> type >> x >> y;

        if(type == 0){
            SegTree::update(1, 1, n, Time[x], y);
        }else{
            fout << query(x, y) << '\n';
        }
    }

    return 0;
}