/*
    Those without power, seek us!
    Those with power, fear us!
    We are the Order of the Black Knights!
*/

#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define db double
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 666013
#define DIM 60010000
#define base 256
#define bas 255
#define mod 98999
#define N 100100
#define inf 0x3f3f3f3f
#define pdd pair<double,double>
#define eps 1.e-10
using namespace std;
ifstream f("heavypath.in");
ofstream g("heavypath.out");
/*
    int dx[]={0,0,0,1,-1};
    int dy[]={0,1,-1,0,0};
*/
vector<int> P[N],v[N],A[N];
int n,lant[N],T[N],tip,arb[N],cs,a[N],nrl,niv[N],poz[N],m,x,nod,y;
void dfs(int x,int lvl,int p)
{
    T[x]=p;
    niv[x]=lvl;
    arb[x]=1;
    FIT(it,v[x])
    if(*it!=p)
    {
        dfs(*it,lvl+1,x);
        arb[x]+=arb[*it];
    }
    if(arb[x]==1)
    {
        ++nrl;
        P[nrl].pb(0);
        P[nrl].pb(x);
        poz[x]=1;
        lant[x]=nrl;
        return;
    }
    int best=0;
    FIT(it,v[x])
    if((*it)!=p&&arb[*it]>arb[best])
        best=(*it);
    lant[x]=lant[best];
    P[lant[x]].pb(x);
    poz[x]=P[lant[x]].size()-1;
}
void go(int nod,int st,int dr,int po)
{
    if(st==dr)
    {
        A[nod][po]=a[P[nod][st]];
        return ;
    }
    int mij=(st+dr)>>1;
    go(nod,st,mij,po<<1);
    go(nod,mij+1,dr,(po<<1)+1);
    A[nod][po]=max(A[nod][po<<1],A[nod][(po<<1)+1]);
}
void upd(int nod,int st,int dr,int po,int poz)
{
    if(st==dr)
    {
        A[nod][po]=a[P[nod][st]];
        return ;
    }
    int mij=(st+dr)>>1;
    if(poz<=mij)
        upd(nod,st,mij,po<<1,poz);
    else
        upd(nod,mij+1,dr,(po<<1)+1,poz);
    A[nod][po]=max(A[nod][po<<1],A[nod][(po<<1)+1]);
}
void find(int nod,int st,int dr,int po,int l,int r)
{
    if(st>=l&&dr<=r)
    {
        cs=max(cs,A[nod][po]);
        return;
    }
    int mij=(st+dr)>>1;
    if(l<=mij)
        find(nod,st,mij,po<<1,l,r);
    if(r>mij)
        find(nod,mij+1,dr,(po<<1)+1,l,r);
}
int qr(int a,int b)
{
    cs=0;
    while(1)
    {
        if(lant[a]==lant[b])
        {
            if(poz[a]>poz[b])
                swap(a,b);
            find(lant[a],1,P[lant[a]].size()-1,1,poz[a],poz[b]);
            return cs;
        }
        int x=P[lant[a]][1];
        int y=P[lant[b]][1];
        if(niv[x]<niv[y])
            swap(a,b);
        find(lant[a],1,P[lant[a]].size()-1,1,1,poz[a]);
        a=T[P[lant[a]][1]];
    }
}
int main ()
{
    f>>n>>m;
    FOR(i,1,n)
    f>>a[i];
    FOR(i,1,n-1)
    {
        f>>x>>y;
        v[x].pb(y);
        v[y].pb(x);
    }
    dfs(1,1,0);
    FOR(i,1,nrl)
    {

        int siz=P[i].size()-1;
        FOR(j,1,siz/2)
        {
            swap(P[i][j],P[i][siz-j+1]);
            swap(poz[P[i][j]],poz[P[i][siz-j+1]]);
        }
        A[i].resize(siz*4);
        go(i,1,siz,1);
    }
    FOR(i,1,m)
    {
        f>>tip;
        if(!tip)
        {
            f>>nod>>x;
            a[nod]=x;
            upd(lant[nod],1,P[lant[nod]].size()-1,1,poz[nod]);
        }
        else
        {
            f>>nod>>x;
            g<<qr(nod,x)<<"\n";
        }
    }
    return 0;
}