#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 1e5 + 5, INF = 1e9 + 9;

int n, m;
int w[N], nw[N];
int h[N], ne[N], e[N], idx;
int id[N], sz[N], fa[N], son[N], cnt, dep[N], top[N];
struct node {
    int l, r;
    int max, min, lmax, rmax;
    int lazy;
}tr[N * 4];

void add_edge(int a, int b) {
    ne[idx] = h[a], e[idx] = b, h[a] = idx ++;
}

void dfs1(int u, int father, int depth) {
    fa[u] = father, dep[u] = depth, sz[u] = 1;
    for(int i = h[u]; ~i; i = ne[i]) {
        int j = e[i];
        if(j == father) continue;
        dfs1(j, u, depth + 1);
        sz[u] += sz[j];
        if(sz[son[u]] < sz[j]) son[u] = j;
    }
}

void dfs2(int u, int t) {
    id[u] = ++ cnt, nw[cnt] = w[u], top[u] = t;
    if(!son[u]) return;
    dfs2(son[u], t);
    for(int i = h[u]; ~i; i = ne[i]) {
        int j = e[i];
        if(j == fa[u] || j == son[u]) continue;
        dfs2(j, j);
    }
}

void pushup(int u) {
    tr[u].max = max(tr[u << 1].max, tr[u << 1 | 1].max);
    tr[u].min = min(tr[u << 1].min, tr[u << 1 | 1].min);
    tr[u].lmax = max(tr[u << 1].max - tr[u << 1 | 1].min, max(tr[u << 1].lmax, tr[u << 1 | 1].lmax));
    tr[u].rmax = max(tr[u << 1 | 1].max - tr[u << 1].min, max(tr[u << 1].rmax, tr[u << 1 | 1].rmax));
}

void add(int u, int v) {
    tr[u].max += v, tr[u].min += v, tr[u].lazy += v;
}

void pushdown(int u) {
    if(tr[u].lazy) {
        add(u << 1, tr[u].lazy), add(u << 1 | 1, tr[u].lazy);
        tr[u].lazy = 0;
    }
}

node merge(node l, node r) {
    node res;
    res.max = max(l.max, r.max);
    res.min = min(l.min, r.min);
    res.lmax = max(l.max - r.min, max(l.lmax, r.rmax));
    res.rmax = max(r.max - l.min, max(l.rmax, r.rmax));
    return res;
}

void build(int u, int l, int r) {
    tr[u] = {l, r, nw[l], nw[l], 0, 0, 0};
    if(l == r) return;
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
    pushup(u);
}

void update(int u, int l, int r, int v) {
    if(l <= tr[u].l && tr[u].r <= r) {
        add(u, v);
        return;
    }
    pushdown(u);
    int mid = tr[u].l + tr[u].r >> 1;
    if(l <= mid) update(u << 1, l, r, v);
    if(r > mid) update(u << 1 | 1, l, r, v);
    pushup(u);
}

node query(int u, int l, int r) {
    if(l <= tr[u].l && tr[u].r <= r) {
        return tr[u];
    }
    int mid = tr[u].l + tr[u].r >> 1;
    if(r <= mid) return query(u << 1, l, r);
    if(l > mid) return query(u << 1 | 1, l, r);
    return merge(query(u << 1, l, r), query(u << 1 | 1, l, r));
}

int query_path(int x, int y) {
    node l, r;
    l.min = r.min = INF;
    while(top[x] != top[y]) {
        if(dep[top[x]] < dep[top[y]]) {
            r = merge(query(1, id[top[y]], id[y]), r);
            y = fa[top[y]];
        }
        else {
            l = merge(l, query(1, id[top[x]], id[x]));
            x = fa[top[x]];
        }
    }
    if(dep[x] < dep[y]) {
        r = merge(query(1, id[x], id[y]), r);
    }
    else l = merge(l, query(1, id[y], id[x]));
    return max(r.max - l.min, max(l.lmax, r.rmax));
}

void update_path(int x, int y, int v) {
    while(top[x] != top[y]) {
        if(dep[top[x]] < dep[top[y]]) swap(x, y);
        update(1, id[top[x]], id[x], v);
        x = fa[top[x]];
    }
    if(dep[x] < dep[y]) swap(x, y);
    update(1, id[y], id[x], v);
}

int main() {

    memset(h, -1, sizeof h);
    cin >> n;

    for(int i = 1; i <= n; ++ i) cin >> w[i];

    for(int i = 0; i < n - 1; ++ i) {
        int a, b;
        cin >> a >> b;
        add_edge(a, b), add_edge(b, a);
    }

    dfs1(1, -1, 1);
    dfs2(1, 1);
    build(1, 1, n);

    cin >> m;

    while(m -- ) {
        int a, b, c;
        cin >> a >> b >> c;
        cout << query_path(a, b) << endl;
        update_path(a, b, c);
    }

    return 0;
}