#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define vec vector
#define flist forward_list
#define um unordered_map
#define us unordered_set
#define prioq priority_queue
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define ld long double
#define pll pair<ll, ll>

#define LL_MAX LLONG_MAX
#define LL_MIN LLONG_MIN
#define ULL_MAX ULLONG_MAX
#define ULL_MIN 0
#define LD_MAX LDBL_MAX
#define LD_MIN LDBL_MIN

#define nl '\n'

#define vv(type, name, n, ...) vector<vector<type>> name(n, vector<type>(__VA_ARGS__))
#define vvv(type, name, n, m, ...)                                                                                     \
    vector<vector<vector<type>>> name(n, vector<vector<type>>(m, vector<type>(__VA_ARGS__)))

// https://trap.jp/post/1224/
#define rep1(n) for(ll i=0; i<(ll)(n); ++i)
#define rep2(i,n) for(ll i=0; i<(ll)(n); ++i)
#define rep3(i,a,b) for(ll i=(ll)(a); i<(ll)(b); ++i)
#define rep4(i,a,b,c) for(ll i=(ll)(a); i<(ll)(b); i+=(c))
#define cut4(a,b,c,d,e,...) e
#define rep(...) cut4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)
#define rep1e(n) for(ll i=1; i<=(ll)(n); ++i)
#define rep2e(i,n) for(ll i=1; i<=(ll)(n); ++i)
#define rep3e(i,a,b) for(ll i=(ll)(a); i<=(ll)(b); ++i)
#define rep4e(i,a,b,c) for(ll i=(ll)(a); i<=(ll)(b); i+=(c))
#define repe(...) cut4(__VA_ARGS__,rep4e,rep3e,rep2e,rep1e)(__VA_ARGS__)
#define per1(n) for(ll i=((ll)n)-1; i>=0; --i)
#define per2(i,n) for(ll i=((ll)n)-1; i>=0; --i)
#define per3(i,a,b) for(ll i=((ll)a)-1; i>=(ll)(b); --i)
#define per4(i,a,b,c) for(ll i=((ll)a)-1; i>=(ll)(b); i-=(c))
#define per(...) cut4(__VA_ARGS__,per4,per3,per2,per1)(__VA_ARGS__)
#define per1e(n) for(ll i=((ll)n); i>=1; --i)
#define per2e(i,n) for(ll i=((ll)n); i>=1; --i)
#define per3e(i,a,b) for(ll i=((ll)a); i>=(ll)(b); --i)
#define per4e(i,a,b,c) for(ll i=((ll)a); i>=(ll)(b); i-=(c))
#define pere(...) cut4(__VA_ARGS__,per4e,per3e,per2e,per1e)(__VA_ARGS__)
#define rep_subset(i,s) for(ll i=(s); i>=0; i=(i==0?-1:(i-1)&(s)))
// #define forit(v) for (auto it = v.begin(); it != v.end(); it++)
// #define forit2(it, v) for (auto it = v.begin(); it != v.end(); it++)
// #define forrit(v) for (auto it = v.rbegin(); it != v.rend(); it++)
// #define forrit2(it, v) for (auto it = v.rbegin(); it != v.rend(); it++)

// #ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(vector<vector<T>> x){cerr << "\n"; for(auto i: x) {for(auto j : i) {cerr << j << ' ';} cerr << "\n";}}
template<typename T> void _do(vector<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(unordered_set<T> x){for(auto i: x) cerr << i << ' ';cerr << "\n";}
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
// #else
// #define bug(...) 777771449
// #endif

const ll MOD = 1e9 + 7;

const string FILENAME = "heavypath";
ifstream fin(FILENAME + ".in");
ofstream fout(FILENAME + ".out");

#define cin fin
#define cout fout

vec<flist<ll>> adj;
vec<ll> parent, pos, heavy, head, tour, log_2, cost, vals, depth, posTour;
vec<vec<ll>> st;
vec<ll> segt;

ll lca(ll a, ll b);
ll minByDepth(ll a, ll b);
ll dfsTour(ll v, ll p, ll d);
void dfsDecomp(ll v, ll h, ll p);
void initLca();
void initSegt();
void buildSegt(ll i, ll l, ll r);
void updateSegt(ll pos, ll val);
void updateSegtAux(ll i, ll l, ll r, ll pos, ll val);
ll querySegt(ll l, ll r);
ll querySegtAux(ll i, ll l, ll r, ll a, ll b);
ll maxPath(ll anc, ll node);

int main()
{
	ll n, q;
	
	cin >> n >> q;
	
	adj.resize(n);
	parent.resize(n);
	pos.resize(n);
	heavy.assign(n, -1);
	head.resize(n);
	depth.resize(n);
	tour.reserve(2 * n + 10);
	posTour.resize(n);
	cost.resize(n);
	vals.reserve(n);
	log_2.resize(2 * n + 10);
	log_2[0] = -1;
	rep(i, 1, log_2.size()) log_2[i] = log_2[i / 2] + 1;
	
	rep(n)
	{
		cin >> cost[i];
	}
	
	rep(n - 1)
	{
		ll a, b;
		cin >> a >> b;
		a--, b--;
		adj[a].pf(b);
		adj[b].pf(a);
	}
	
	initLca();
	dfsDecomp(0, 0, -1);
	initSegt();
	
	rep(q)
	{
		ll t, x, y;
		cin >> t >> x >> y;
		
		if(t == 0)
		{
			x--;
			vals[pos[x]] = y;
			updateSegt(pos[x], y);
		}
		else
		{
			x--;
			y--;
			ll anc = lca(x, y);
			cout << max(maxPath(anc, x), maxPath(anc, y)) << nl;
		}
	}
    return 0;
}

ll maxPath(ll anc, ll node)
{
	ll res = vals[pos[node]];
	
	while(node != anc)
	{
		if(head[node] == node)
		{
			node = parent[node];
			res = max(res, vals[pos[node]]);
		}
		else if(head[node] != head[anc])
		{
			res = max(res, querySegt(pos[head[node]], pos[node]));
			node = head[node];
		}
		else if(head[node] == head[anc])
		{
			res = max(res, querySegt(pos[anc], pos[node]));
			node = anc;
		}
	}
	
	return max(res, vals[pos[anc]]);
}
void initSegt()
{
	segt.resize(vals.size() * 4 + 10);
	buildSegt(1, 0, vals.size() - 1);
}
void buildSegt(ll i, ll l, ll r)
{
	if(l == r)
	{
		segt[i] = vals[l];
		return;
	}
	
	ll mid = (l + r) / 2;
	buildSegt(i * 2, l, mid);
	buildSegt(i * 2 + 1, mid + 1, r);
	segt[i] = max(segt[i * 2], segt[i * 2 + 1]);
}
void updateSegt(ll pos, ll val)
{
	updateSegtAux(1, 0, vals.size() - 1, pos, val);
}
void updateSegtAux(ll i, ll l, ll r, ll pos, ll val)
{
	if(l == r)
	{
		segt[i] = val;
		return;
	}
	
	ll mid = (l + r) / 2;
	
	if(pos <= mid)
	{
		updateSegtAux(i * 2, l, mid, pos, val);
	}
	else
	{
		updateSegtAux(i * 2 + 1, mid + 1, r, pos, val);
	}
	
	segt[i] = max(segt[i * 2], segt[i * 2 + 1]);
}
ll querySegt(ll l, ll r)
{
	return querySegtAux(1, 0, vals.size() - 1, l, r);
}
ll querySegtAux(ll i, ll l, ll r, ll a, ll b)
{
	if(b < l || a > r)
	{
		return -1;
	}
	else if(a <= l && r <= b)
	{
		return segt[i];
	}
	
	ll mid = (l + r) / 2;
	return max(querySegtAux(i * 2, l, mid, a, b), querySegtAux(i * 2 + 1, mid + 1, r, a, b));
}
void dfsDecomp(ll v, ll h, ll p)
{
	vals.pb(cost[v]);
	pos[v] = vals.size() - 1;
	head[v] = h;
	
	if(heavy[v] != -1)
	{
		dfsDecomp(heavy[v], h, v);
	}
	
	for(auto u : adj[v])
	{
		if(u != p && u != heavy[v])
			dfsDecomp(u, u, v);
	}
}
ll lca(ll a, ll b)
{
	ll ap = posTour[a], bp = posTour[b];
	if(ap > bp) swap(a, b), swap(ap, bp);
	
	ll exp = log_2[bp - ap + 1], pw2 = (1ll << exp);
	return tour[minByDepth(st[ap][exp], st[bp - pw2 + 1][exp])];
}
ll minByDepth(ll a, ll b)
{
	return depth[tour[a]] < depth[tour[b]] ? a : b;
}
ll dfsTour(ll v, ll p, ll d)
{
	tour.pb(v);
	depth[v] = d;
	posTour[v] = tour.size() - 1;
	parent[v] = p;
	ll size = 1, maxUSize = 0;
	
	for(auto u : adj[v])
	{
		if(u == p) continue;
		
		ll uSize = dfsTour(u, v, d + 1);
		if(uSize > maxUSize)
		{
			maxUSize = uSize;
			heavy[v] = u;
		}
		size += uSize;
		tour.pb(v);
	}
	
	return size;
}
void initLca()
{
	dfsTour(0, -1, 0);
	st.assign(tour.size(), vec<ll>(log_2[tour.size()] + 1, 0));
	
	rep(st.size())
	{
		st[i][0] = i;
	}
	
	rep(i, 1, st[0].size())
	{
		ll pw2 = (1ll << i);
		
		for(ll j = 0; j + pw2 - 1 < st.size(); j++)
		{
			st[j][i] = minByDepth(st[j][i - 1], st[j + (pw2 >> 1ll)][i - 1]);
		}
	}
}