#include <fstream>
#include <vector>
#include <algorithm>
#define pb push_back
using namespace std;
using pii = pair<int,int>;

ifstream cin("heavypath.in");
ofstream cout("heavypath.out");

const int MAX = 1e5 + 1;

int n , q , aint[4*MAX] , nrd[MAX] , v[MAX] , wo[MAX] , hn , x , y , t[MAX] , depth[MAX];
int poz[MAX] , ind , mx;
bool viz[MAX];

vector <int> f(MAX);
vector <pii> in(MAX);
vector <int> st;
vector <int> g[MAX];

void update( int nod , int st , int dr ,int &poz , int &val){

    if(st==dr){

        aint[nod] = val;

    }else{

        int mij = (st+dr)/2;
        if(poz <= mij) update(nod*2,st,mij,poz,val);
        else update(nod*2+1,mij+1,dr,poz,val);

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

int query( int nod , int st , int dr , int &qst , int &qdr){

    if(qst<=st && dr<=qdr){

        return aint[nod];

    }else{

        int val = -1;
        int mij = (st+dr)/2;
        if(qst <= mij) val = max(val,query(nod*2,st,mij,qst,qdr));
        if(qdr > mij) val = max(val,query(nod*2+1,mij+1,dr,qst,qdr));
        return val;
    }
}

void dfs( int x , int p ){

    depth[x] = depth[p]+1;

    t[x] = p;

    for(auto it : g[x]){

        if(it!=p){

            dfs(it,x);
            nrd[x]+=nrd[it];
        }
    }

    nrd[x]++;
    bool is = 0;

    for(auto it : g[x]){

        if(it!=p){

            if(nrd[it]>=nrd[x]/2){

                is = 1;
            }
        }
    }

    if(!is) st.push_back(x);
}

signed main(){

    cin >> n >> q;

    for(int i = 1 ; i <= n ; i++){

        cin >> v[i];
    }

    for(int i = 1 ; i < n ; i++){

        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }

    dfs(1,0);

    for(auto it : st){

        int k = 0;

        ++hn;

        while(it>0 && !viz[it] && nrd[it] >= nrd[t[it]]/2){
            viz[it] = 1;
            wo[it] = hn;
            f[hn] = it;
            k++;
            ind++;
            update(1,1,n,ind,v[it]);
            poz[it] = ind;
            it = t[it];
        }

        if(it!=0 && !viz[it]){
            wo[it] = hn;
            f[hn] = it;
            k++;
            ind++;
            update(1,1,n,ind,v[it]);
            poz[it] = ind;
        }

        in[hn] =  make_pair(ind - k + 1,ind);
    }

    int op , a , b;

    while(q--){

        cin >> op >> a >> b;
        if(!op){

            update(1,1,n,poz[a],b);

        }else{

            mx = -1;

            vector <int> first;
            vector <int> second;

            int ca = a;

            while(ca){

                first.push_back(wo[ca]);
                ca = t[f[wo[ca]]];
            }

            ca = b;

            while(ca){

                second.push_back(wo[ca]);
                ca = t[f[wo[ca]]];
            }

            reverse(first.begin(),first.end());
            reverse(second.begin(),second.end());

            int asta = 0;

            for(int i = 0 ; i < (int)min(first.size(),second.size()); i++){

                if(first[i]==second[i]){
                    asta = first[i];
                }else break;
            }

            while(wo[a]!=asta){

                mx = max(mx,query(1,1,n,poz[a],poz[f[wo[a]]]));
                a = t[f[wo[a]]];
            }

            while(wo[b]!=asta){

                mx = max(mx,query(1,1,n,poz[b],poz[f[wo[b]]]));
                b = t[f[wo[b]]];
            }

            int mp = min(poz[a],poz[b]) , mxp = max(poz[a],poz[b]);

            mx = max(mx,query(1,1,n,mp,mxp));

            cout << mx << '\n';
        }
    }

    return 0;
}