Homework（https://acs.jxnu.edu.cn/problem/ICPCJX2021I）

描述：

Cirno is a strict teacher, while Wings is a naughty student.

Cirno assigns a huge amount of homework to nn of her students, including Wings every day. Wings wants to finish the homework as soon as possible. He calls on the classmates to copy homework from each other. Due to the different abilities of these students, the time it takes for each to finish the homework independently may be different. After discussion, in order to make everyone finish the homework as soon as possible, these students developed a solution: one can ask other who has finished the homework for answers and then just copy that. Cirno is too strict with her students, she has confiscated all the Internet-capable devices of her students, so these students must copy the homework in a more primitive way — going to another student's home.

There are n−1n−1 bidirectional roads between the homes of nn students and each road connects two students' homes. Any two students can reach each other's home directly or indirectly. If student ii intends to copy student jj's homework, he or she must wait for student jj to finish the homework, then leaves for student jj 's home and copies the homework, and finally returns home (The homework is considered to be finished only when the student returns home). The time taken for student ii to leave for student jj's home, copy the homework, and finally return home equals to the distance between student ii's home and student jj's home.

Soon, Cirno discovered Wings's tricks. She was very angry, so she planned to calculate the earliest time for each student to finish the homework, and increase the amount of homework according to the situation as a punishment. However, the students' learning status and the road lengths will change. Cirno asks you to help her to calculate the earliest time for each student to finish the homework in different situation.

输入：

The first line contains two positive integers n,q (1≤n,q≤105)n,q (1≤n,q≤105). nn denotes the number of students. qq denotes the total number of changes and queries.

The next line contains nn space separated integers ai(0≤ai≤109)ai(0≤ai≤109), denoting the time for student ii to finish the homework independently.

The next n−1n−1 lines contain the description of roads between students' homes. Each line contains three integers u,v,w (1≤u,v≤n,0≤w≤109)u,v,w (1≤u,v≤n,0≤w≤109), denoting that there is a road with length ww, connecting student uu's home and student vv's home.

The next qq lines contain descriptions of changes and queries. Each line describes one type of change or a single query.

The first type of change is described by three integers op,i,x (op=1,1≤i≤n,0≤x≤109)op,i,x (op=1,1≤i≤n,0≤x≤109), which means the time for student ii to finish the homework independently changes to xx;

The second type of change is described by three integers op,i,w (op=2,1≤i<n,0≤w≤109)op,i,w (op=2,1≤i<n,0≤w≤109), which means the length of the ii-th road in the input changes to ww.

The query is described by one integer op (op=3)op (op=3), which means you need to calculate the earliest time for each student to finish the homework.

It's guaranteed that any two students can reach each other's home directly or indirectly. And it's guaranteed that the number of queries does not exceed 200200.

输出：

For each query, print an integer in one line. Let titi denotes the earliest time for student ii to finish the homework. The integer you need to print is t1⊕t2⊕⋯⊕tnt1⊕t2⊕⋯⊕tn(⊕⊕ denotes the bitwise XOR operation).

翻译：Cirno是一个严格的老师，而wings是一个调皮的学生.

Cirno每天布置了很多作业给他的n个学生，包括wings.wings想要尽快完成作业.他联系同学相互抄作业.术业有专攻，每个铜须独立完成作业所需时间不同.经过讨论之后，为了使每个人尽快完成作业.这些学生提出了一个方案：一个人可以询问其他已经完成作业的同学答案并且展开cv大法.cirno对他学生很严格，他没收了学生所有互联网设备，所以这些学生必须用更质朴的方式cv作业----去同学家.

n个学生的家彼此之间有n-1条路径.任何两个学生都可以直接间接到达对方的家.如果一个学生i想要去j的家里展开cv大法，TA必须等待j同学完成作业，然后前往j的家里做法最后回家（作业只有在回家之后才能视为完成）.其中i同学前往j同学家、做法、最后回家的时间等价于ij同学家之间的距离.

接下来，cirno发现wings的把戏.她很生气，所以她计划计算每个同学完成作业最速时间，还根据情况给作业加码以作为惩罚.然而，学生的学习状态和路径长度发生变化.cirno想让你助纣为虐，帮助她计算每个同学在不同情况下完成作业的最速时间.

输入：第一个有两个整数nq（1<=n,q<=10E5）.n为学生总数，q为改变和指令的总数

下一行有n个数ai，代表着学生i独立完成作业的时间.

后续n-1行描述同学家之间的距离，每行3个整数uvw（1<=u,u<=nm0<=w<=10E9）,表示u同学和v同学家之间的距离是w.

接下来q行描述改变和指令.每行一个类型的表变或者单个指令.

第一种改变的情形用三个整数表示op，i，x（op=1,1<=i<n,0<=x<=10E9）.意味着学生i独立完成作业的时间改为x.

第二种改变的情形用三个数表示op,i,w（op=2,i<=n<n,0<=w<=10E9）,意味着第i条路径长度改为w.

该指令用一个整数描述op（op=3）,这意味着你需要计算每个学生完成作业的最速时间.

这里保证任何两个学生可以直接或间接到达对方的家，以及指令数不超过200.

输出：对于每个指令，一行输出一个整数.令ti描述学生i完成作业的最速时间.你需要输出的数字为 t1⊕t2⊕⋯⊕tn（⊕为按位异或运算）