#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <unordered_map>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>
#include <cassert>
#include <stdlib.h>
#include <time.h>
#include <random>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,sse3,sse4")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx2")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")

#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

//const int INF = 1e17;
//const int mod = 2600000069;
//const int p = 179;
const int MAXN = 1e5;
const int logn = 18;

int n;
int tin[MAXN], tout[MAXN], up[MAXN][logn], val[MAXN], sum[MAXN];
vector<int> g[MAXN];
int timer = 0;

void dfs(int v, int p) {
    up[v][0] = p;
    for (int i = 1; i < logn; i++) {
        up[v][i] = up[up[v][i - 1]][i - 1];
    }
    tin[v] = timer++;
    sum[tin[v]] = sum[tin[p]] + val[v];
    for (auto u : g[v]) {
        if (u != p) dfs(u, v);
    }
    tout[v] = timer;
}

bool ancestor(int u, int v) {
    return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int lca(int u, int v) {
    if (ancestor(u, v)) return u;
    if (ancestor(v, u)) return v;
    for (int i = logn - 1; i >= 0; i--) {
        if (!ancestor(up[v][i], u)) {
            v = up[v][i];
        }
    }
    return up[v][0];
}

void ask() {
    int v, u;
    cin >> v >> u;
    u--;v--;
    int l = lca(u, v);
    if (l == u) {
        cout << sum[tin[v]] - (u != up[u][0] ? sum[tin[up[u][0]]] : 0) << "\n";
    } else if (l == v) {
        cout << sum[tin[u]] - (v != up[v][0] ? sum[tin[up[v][0]]] : 0) << "\n";
    } else {
        cout << sum[tin[u]] + sum[tin[v]] - (l != up[l][0] ? 2 * sum[tin[up[l][0]]] : 0) - val[l] << "\n";
    }
}

void setv() {
    int v, x;
    cin >> v >> x;
    v--;
    for (int i = tin[v]; i < tout[v]; i++) {
        sum[i] += x - val[v];
    }
    val[v] = x;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 0; i < n; i++) cin >> val[i];
    int u, v;
    for (int i = 0; i < n - 1; i++) {
        cin >> u >> v;
        u--;v--;
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(0, 0);
    int q;
    cin >> q;
    char t;
    while(q--) {
        cin >> t;
        if (t == '?') ask();
        else setv();
    }
}
/*
*/