#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <cassert>
#include <queue>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <ctime>
#include <map>
#include <set>
using namespace std;
// #define int long long
#define pii pair<int, int>
#define eb emplace_back
#define F first
#define S second
#define test(x) cout << "Test: " << x << '\n'
#define debug puts("qwq");
#define open(x) freopen(#x".in", "r", stdin);freopen(#x".out", "w", stdout);
#define close fclose(stdin);fclose(stdout);
namespace FastIO {
	template <typename T = int>
	inline T read() {
		T s = 0, w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		return s * w;
	}
	template <typename T>
	inline void read(T &s) {
		s = 0;
		int w = 1;
		char c = getchar();
		while (!isdigit(c)) {
			if (c == '-') w = -1;
			c = getchar();
		}
		while (isdigit(c)) s = (s << 1) + (s << 3) + (c ^ 48), c = getchar();
		s = s * w;
	}
	template <typename T, typename... Arp> inline void read(T &x, Arp &...arp) {
		read(x), read(arp...);
	}
	template <typename T>
	inline void write(T x, char ch) {
		if (x < 0) x = -x, putchar('-');
		static char stk[25];
		int top = 0;
		do {
			stk[top++] = x % 10 + '0', x /= 10;
		} while (x);
		while (top) putchar(stk[--top]);
		putchar(ch);
		return;
	}
	template <typename T>
	inline void smax(T &x, T y) {
		if (x < y) x = y;
	}
	template <typename T>
	inline void smin(T &x, T y) {
		if (x > y) x = y;
	}
	void quit() {
		exit(0);
	}
} using namespace FastIO;
const int N = 1e5 + 19;
vector<int> g[N];
int dep[N], fa[N], top[N], cnt, dfn[N], son[N], siz[N], a[N];
void dfs(int u, int f) {
	fa[u] = f; dep[u] = dep[f] + 1; siz[u] = 1;
	for (int i : g[u]) {
		if (i == f) continue;
		dfs(i, u);
		siz[u] += siz[i];
		if (siz[i] > siz[son[u]]) son[u] = i;
	}
}
void dfs2(int u, int f) {
	top[u] = f; dfn[u] = ++cnt;
	if (son[u]) dfs2(son[u], f);
	for (int i : g[u]) if (i ^ fa[u] && i ^ son[u]) dfs2(i, i);
}
struct node {
	int lmax, rmax, max, sum;
} t[N << 2];
node merge(node A, node B) {
	return {max(A.lmax, A.sum + B.lmax), max(B.max, B.sum + A.rmax), max(max(A.max, B.max), A.rmax + B.lmax), A.sum + B.sum};
} 
struct SegTree {
	int tag[N << 2], len[N << 2];
	#define ls (k << 1)
	#define rs (k << 1)
	#define mid ((l + r) >> 1)
	void build(int k, int l, int r) {
		len[k] = r - l + 1; tag[k] = 1e9;
		if (l == r) return t[k] = {max(a[l], 0), max(a[l], 0), max(a[l], 0), a[l]}, void();
		build(ls, l, mid); build(rs, mid+1, r);
		t[k] = merge(t[ls], t[rs]);
	}
	void pushdown(int k) {
		if (tag[k] < 1e9) {
			t[ls] = {max(0, tag[k]) * len[ls], max(0, tag[k]) * len[ls], max(0, tag[k]) * len[ls], tag[k] * len[ls]};
			t[rs] = {max(0, tag[k]) * len[rs], max(0, tag[k]) * len[rs], max(0, tag[k]) * len[rs], tag[k] * len[rs]};
			tag[k] = 1e9;
		}
	}
	void modify(int k, int l, int r, int L, int R, int x) {
		if (L <= l && r <= R) {
			tag[k] = x;
			t[k] = {max(0, x) * len[k], max(0, x) * len[k], max(0, x) * len[k], x * len[k]};
			return ;
		} pushdown(k);
		if (L <= mid) modify(ls, l, mid, L, R, x);
		if (R > mid) modify(rs, mid+1, r, L, R, x);
		t[k] = merge(t[ls], t[rs]);
	}
	node query(int k, int l, int r, int L, int R) {
		if (L <= l && r <= R) return t[k];
		pushdown(k);
		if (L <= mid && R > mid) return merge(query(ls, l, mid, L, R), query(rs, mid+1, r, L, R));
		if (R <= mid) return query(ls, l, mid, L, R);
		return query(rs, mid+1, r, L, R);
	}
} seg;
signed main() {
	int n = read();
	for (int i = 1; i <= n; ++i) read(a[i]);
	for (int i = 1, u, v; i < n; ++i) {
		read(u, v);
		g[u].eb(v); g[v].eb(u);
	} dfs(1, 0); dfs2(1, 1);
	int q = read(); seg.build(1, 1, n);
	while (q--) {
		int op, u, v;
		read(op, u, v);
		if (op == 1) {
			node ans1 = {0, 0, 0, 0}, ans2 = {0, 0, 0, 0};
			while (top[u] ^ top[v]) {
				if (dep[top[u]] < dep[top[v]]) {
					ans2 = merge(seg.query(1, 1, n, dfn[top[v]], dfn[v]), ans2);
					v = fa[top[v]];
				} else {
					ans1 = merge(ans1, seg.query(1, 1, n, dfn[top[u]], dfn[u]));
					u = fa[top[u]];
				}
			}
			if (dep[u] < dep[v]) ans2 = merge(seg.query(1, 1, n, dfn[u], dfn[v]), ans2);
			else ans1 = merge(ans1, seg.query(1, 1, n, dfn[v], dfn[u]));
			write(merge(ans1, ans2).max, '\n');
		} else seg.modify(1, 1, n, u, v, read());
	}
	return 0;
}