#include <bits/stdc++.h>

using namespace std;
ifstream fin("heavypath.in");
ofstream fout("heavypath.out");
int n,m,x,y,counter,t;
int val[100005];
vector<int>nod[100005],mx[100005];
int heigth[100005];
int path[100005];
int inc[100005];
int parent[100005];
vector<int>elem[100005];
vector<int>ain_path[100005];
void go_visit(int pos,int p,int h,int last)
{
    path[pos]=p;
    elem[p].push_back(pos);
    heigth[pos]=h;
    bool ok=true;
    if(last==0 && nod[pos].size()>1)ok=false;
    if(last!=0 && nod[pos].size()>2)ok=false;
    for(int i=0;i<nod[pos].size();i++)
    {
        if(nod[pos][i]==last)continue;
        if(!ok)
        {
            counter++;
            parent[counter]=p;
            inc[counter]=h+1;
            go_visit(nod[pos][i],counter,h+1,pos);
        }
        else
            go_visit(nod[pos][i],p,h+1,pos);
    }
}
void modify(int p,int pos,int st,int dr,int l,int r,int v)
{
    if(l>dr || r<st)return;
    if(st==dr)
    {
        ain_path[p][pos]=v;
        return;
    }
    int mid=(st+dr)/2;
    modify(p,pos*2,st,mid,l,r,v);
    modify(p,pos*2+1,mid+1,dr,l,r,v);
    ain_path[p][pos]=max(ain_path[p][2*pos],ain_path[p][pos*2+1]);
}
int get_mx(int p,int pos,int st,int dr,int l,int r)
{
    if(l>dr || r<st)return 0;
    if(l<=st && r>=dr)
        return ain_path[p][pos];
    int mid=(st+dr)/2;
    return max(get_mx(p,pos*2,st,mid,l,r),get_mx(p,pos*2+1,mid+1,dr,l,r));
}
void get_ans()
{
    int rez=0;
    while(path[x]!=path[y])
    {
        if(heigth[x]>heigth[y])swap(x,y);
        rez=max(rez,get_mx(path[y],1,1,elem[path[y]].size(),1,heigth[y]-inc[path[y]]+1));
        y=elem[parent[path[y]]].back();
    }
    if(heigth[x]>heigth[y])swap(x,y);
    fout<<max(rez,get_mx(path[x],1,1,elem[path[x]].size(),heigth[x]-inc[path[y]]+1,heigth[y]-inc[path[y]]+1))<<"\n";
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
       fin>>val[i];
    for(int i=1;i<n;i++)
    {
        fin>>x>>y;
        nod[x].push_back(y);
        nod[y].push_back(x);
    }
    inc[1]=0;
    counter=1;
    go_visit(1,1,0,0);
    for(int i=1;i<=counter;i++)
    {
        ain_path[i].resize(((int)elem[i].size())*2+2);
        ain_path[i].assign(((int)elem[i].size())*2+2,0);
    }
    for(int i=1;i<=n;i++)
        modify(path[i],1,1,elem[path[i]].size(),heigth[i]-inc[path[i]]+1,heigth[i]-inc[path[i]]+1,val[i]);
    for(int i=1;i<=m;i++)
    {
        fin>>t>>x>>y;
        if(t==0)
            modify(path[x],1,1,elem[path[x]].size(),heigth[x]-inc[path[x]]+1,heigth[x]-inc[path[x]]+1,y);
        else
            get_ans();
    }
    return 0;
}