1
 2
 3
 4
 5
 6
 7
 8
 9
10

8 1
1 10 100 1000 10000 100000 1000000 10000000
1 2
1 3
2 4
2 5
3 6
3 7
3 8
0 3 1

1

11100101

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225

#include "ybwhead/ios.h"
const int maxn = 2e5 + 10;
int a[maxn];
int n, m;
struct edge
{
    int v, nxt;
} e[maxn << 1];
int tot, head[maxn];
void __ADD(int u, int v)
{
    e[++tot].v = v;
    e[tot].nxt = head[u];
    head[u] = tot;
}
void add(int u, int v)
{
    __ADD(u, v);
    __ADD(v, u);
}
int stt[20][maxn], num;
int dep[maxn], id1[maxn];
int lg2[maxn];
void dfs1(int u, int fa)
{
    dep[u] = dep[fa] + 1;
    stt[0][++num] = u;
    id1[u] = num;
    for (int i = head[u]; i; i = e[i].nxt)
    {
        int v = e[i].v;
        if (v == fa)
            continue;
        dfs1(v, u);
        stt[0][++num] = u;
    }
}
int lower(int x, int y)
{
    return dep[x] < dep[y] ? x : y;
}
void getst()
{
    for (int i = 2; i <= tot; i++)
        lg2[i] = lg2[i >> 1] + 1;
    for (int i = 1; (1 << i) <= tot; i++)
    {
        int w = (1 << i);
        for (int j = 1; j + w - 1 <= tot; j++)
        {
            stt[i][j] = lower(stt[i - 1][j], stt[i - 1][j + w / 2]);
        }
    }
}
int LCA(int x, int y)
{
    x = id1[x];
    y = id1[y];
    if (x > y)
        swap(x, y);
    int i = lg2[y - x + 1], w = (1 << i);
    return lower(stt[i][x], stt[i][y - w + 1]);
}
int Dis(int x, int y)
{
    return dep[x] + dep[y] - 2 * dep[LCA(x, y)];
}
int siz[maxn], maxs[maxn];
int dfa[maxn];
int vis[maxn];
int dsiz[maxn];
int dfs2(int u, int fa, int tots)
{
    siz[u] = 1;
    maxs[u] = 0;
    int cen = 0;
    for (int i = head[u]; i; i = e[i].nxt)
    {
        int v = e[i].v;
        if (vis[v] || v == fa)
            continue;
        int vcen = dfs2(v, u, tots);
        if (!cen || maxs[vcen] < maxs[cen])
            cen = vcen;
        siz[u] += siz[v];
        maxs[u] = max(maxs[u], siz[v]);
    }
    maxs[u] = max(maxs[u], tots - siz[u]);
    if (!cen || maxs[u] < maxs[cen])
        cen = u;
    return cen;
}
void divide(int cen, int tots)
{
    vis[cen] = 1;
    dsiz[cen] = tots;
    for (int i = head[cen]; i; i = e[i].nxt)
    {
        int v = e[i].v;
        if (vis[v])
            continue;
        int vsize = (siz[v] < siz[cen]) ? siz[v] : (tots - siz[cen]);
        int vcen = dfs2(v, cen, vsize);
        dfa[vcen] = cen;
        divide(vcen, vsize);
    }
}
struct node
{
    int sum;
    int ls, rs;
} x[(int)1e7];
int ncnt;
struct Seg
{
    int rt;
    void modify(int &pos, int l, int r, int d, int k)
    {
        if (!pos)
            pos = ++ncnt;
        x[pos].sum += k;
        if (l == r)
            return;
        int mid = (l + r) >> 1;
        if (d <= mid)
            modify(x[pos].ls, l, mid, d, k);
        else
            modify(x[pos].rs, mid + 1, r, d, k);
    }
    int query(int pos, int l, int r, int nl, int nr)
    {
        if (!pos)
            return 0;
        if (l == nl && r == nr)
            return x[pos].sum;
        int mid = (l + r) >> 1;
        if (nr <= mid)
        {
            return query(x[pos].ls, l, mid, nl, nr);
        }
        if (nl > mid)
        {
            return query(x[pos].rs, mid + 1, r, nl, nr);
        }
        return query(x[pos].ls, l, mid, nl, mid) + query(x[pos].rs, mid + 1, r, mid + 1, nr);
    }
} T1[maxn], T2[maxn];
void modify(int idx, int val)
{
    int now = idx;
    while (now)
    {
        int fa = dfa[now];
        T1[now].modify(T1[now].rt, 0, dsiz[now], Dis(now, idx), val);
        // cout << idx << " " << now << " " << Dis(now, idx) << endl;
        if (fa)
            T2[now].modify(T2[now].rt, 0, dsiz[fa], Dis(fa, idx), val);
        now = fa;
    }
}

int query(int idx, int k)
{
    int res = 0;
    int now = idx, last = 0;
    while (now)
    {
        int d = Dis(idx, now);
        if (d > k)
        {
            last = now;
            now = dfa[now];
            continue;
        }
        res += T1[now].query(T1[now].rt, 0, dsiz[now], 0, k - d);
        if (last)
            res -= T2[last].query(T2[last].rt, 0, dsiz[now], 0, k - d);
        last = now;
        // cout << now << " " << T1[now].query(T1[now].rt, 0, dsiz[now], 0, k - d) << endl;
        now = dfa[now];
    }
    return res;
}

void pre()
{
    dfs1(1, 0);
    getst();
    int cen = dfs2(1, 0, n);
    divide(cen, n);
    // cout << LCA(2, 3) << endl;
    for (int i = 1; i <= n; i++)
        modify(i, a[i]);
}
int main()
{
    yin >> n >> m;
    for (int i = 1; i <= n; i++)
        yin >> a[i];
    for (int i = 1; i < n; i++)
    {
        int a, b, c;
        yin >> a >> b;
        add(a, b);
    }
    pre();
    int ans = 0;
    while (m--)
    {
        int opt, x, y;
        yin >> opt >> x >> y;
        x ^= ans;
        y ^= ans;
        if (opt == 0)
        {
            yout << (ans = query(x, y)) << endl;
        }
        else
        {
            modify(x, y - a[x]);
            a[x] = y;
        }
    }
    return 0;
}