#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <cmath>
#include <fstream>
#include <cstdlib>
#include <map>
#include <stack>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define lsb(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("heavypath.in");
ofstream out("heavypath.out");
vector< vector<int> > adj;
vector<int> lvl,v,firstNode,comp,parent,pos,tree,dp;
priority_queue< pair<int,int> > H;
int n,k,np,t;
int dfs(int x,int px)
{
    lvl[x]=lvl[px]+1;
    parent[x]=px;
    for(auto it: adj[x])
        if(it!=px)
        dp[x]+=dfs(it,x);
    H.push(mp(dp[x],x));
    return dp[x]+1;
}
void pathUpd(int x,int left,int right,int position,int val)
{
    if(left==right)
        tree[x]=val;
    else{
        int mid=(left+right)/2;
        if(position<=mid)
            pathUpd(2*x,left,mid,position,val);
        else
            pathUpd(2*x+1,mid+1,right,position,val);
        tree[x]=max(tree[2*x],tree[2*x+1]);
    }
}
int sol;
void pathQuery(int x,int left,int right,int a,int b)
{
    if(a<=left && b>=right)
        sol=max(sol,tree[x]);
    else{
        int mid=(left+right)/2;
        if(a<=mid)
            pathQuery(2*x,left,mid,a,b);
        if(b>mid)
            pathQuery(2*x+1,mid+1,right,a,b);
    }
}
void update(int x,int val)
{
    pathUpd(1,1,n,pos[x],val);
}
int query(int x,int y)
{
    sol=-INF;
    while(comp[x]!=comp[y])
    {
        if(lvl[ firstNode[ comp[x] ] ]>lvl[ firstNode[ comp[y] ] ])
        {

            pathQuery(1,1,n,pos[ firstNode[ comp[x] ] ],pos[x]);
            x=parent[ firstNode[ comp[x] ] ];
        }
        else{
            pathQuery(1,1,n,pos[ firstNode[ comp[y] ] ],pos[y]);
            y=parent[ firstNode[ comp[y] ] ];
        }
    }
    if(pos[x]>pos[y])
        swap(x,y);
    pathQuery(1,1,n,pos[x],pos[y]);
    return sol;
}
void construct(int x)
{
    t++;
    pathUpd(1,1,n,t,v[x]);
    pos[x]=t;
    comp[x]=np;
    int mx=-1,nextNode=0;
    for(auto it: adj[x])
    if(comp[it]==0 && dp[it] > mx)
    {
        mx=dp[it];
        nextNode=it;
    }
    if(nextNode!=0)
        construct(nextNode);
}
int main()
{
    int q;
    in>>n>>q;
    adj=vector< vector<int> > (n+1);
    lvl=parent=firstNode=comp=pos=v=dp=vector<int> (n+1);
    tree=vector<int> (4*n+1);
    for(int i=1;i<=n;i++)
        in>>v[i];
    for(int i=2;i<=n;i++)
    {
        int x,y;
        in>>x>>y;
        adj[x].pb(y);
        adj[y].pb(x);
    }
    dfs(1,1);
    while(!H.empty())
    {
        if(comp[ H.top().second ]==0)
        {
            np++;
            firstNode[np]=H.top().second;
            construct(H.top().second);
        }
        H.pop();
    }
    for(;q;q--)
    {
        int x,y,t;
        in>>t>>x>>y;
        if(t==0)
            update(x,y);
        else
            out<<query(x,y)<<'\n';
    }
    return 0;
}