#[derive(Debug, Clone)] struct SegmentTree { n: usize, orgn: usize, unit: T, mem: Vec, operator: F } impl SegmentTree where T: std::fmt::Debug + Copy, F: Fn(T, T) -> T { fn new(n: usize, unit: T, operator: F) -> Self { let mut size = 1usize; while size < n { size *= 2; } Self { n: size, orgn: n, unit: unit, mem: vec![unit; size*2-1], operator: operator, } } fn find_closed(&self, l: usize, r: usize) -> T { self.find(l, r+1) } fn find(&self, l: usize, r: usize) -> T { self._find(l, r, 0, 0, self.n) } fn set(&mut self, pos: usize, val: T) { let mut pos = pos + self.n - 1; self.mem[pos] = val; while pos > 0 { pos = self._parent(pos); self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]); } } fn get(&mut self, pos: usize) -> T { self.mem[pos + self.n - 1] } fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T { if r <= a || b <= l { return self.unit; } else if a <= l && r <= b { return self.mem[nodenum]; } let left = self._find(a, b, self._left(nodenum), l, (l+r)/2); let right = self._find(a, b, self._right(nodenum), (l+r)/2, r); (self.operator)(left, right) } fn _left(&self, k: usize) -> usize { 2*k+1 } fn _right(&self, k: usize) -> usize { 2*k+2 } fn _parent(&self, k: usize) -> usize { (k-1)/2 } } fn dfs(cur: usize, prev: usize, idx: &mut usize, paths: &Vec>, starts: &mut Vec, ends: &mut Vec) { starts[cur] = *idx; *idx += 1; for &v in paths[cur].iter() { if v == prev { continue; } dfs(v, cur, idx, paths, starts, ends); } ends[cur] = *idx; *idx += 1; } fn main() { let mut nq = String::new(); std::io::stdin().read_line(&mut nq).ok(); let nq: Vec = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nq[0]; let q = nq[1]; let mut c = String::new(); std::io::stdin().read_line(&mut c).ok(); let c: Vec = c.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let mut paths = vec![vec![]; n]; for _ in 0..n-1 { let mut ab = String::new(); std::io::stdin().read_line(&mut ab).ok(); let ab: Vec = ab.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let a = ab[0]-1; let b = ab[1]-1; paths[a].push(b); paths[b].push(a); } let queries = (0..q).map(|_| { let mut temp = String::new(); std::io::stdin().read_line(&mut temp).ok(); let temp: Vec = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); (temp[0], temp[1]-1, temp[2]) }) .collect::>(); let mut starts = vec![0usize; n]; let mut ends = vec![0usize; n]; let mut idx = 0usize; dfs(0, 0, &mut idx, &paths, &mut starts, &mut ends); let mut segtree = SegmentTree::new(2*n, 0usize, |x, y| x ^ y); for i in 0..n { segtree.set(starts[i], c[i]); } for &(t, x, y) in queries.iter() { if t == 1 { let val = segtree.get(starts[x]); segtree.set(starts[x], val ^ y); } else { println!("{}", segtree.find(starts[x], ends[x])); } } }