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
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<int> VI;
const ll INFTY=2000000000000000000;
const int MAX=5100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
ll C[MAX][MAX];
ll Z[MAX];
vector<VI > G(MAX);
int n;
ll dist[MAX];
void dfs(int v,int l){
	//ps(v);
	loop(i,0,SIZE(G[v])){
		if(G[v][i]!=l){
			dist[G[v][i]]=dist[v]+C[v][G[v][i]];
			dfs(G[v][i],v);
		}
	}
}
int main(){
	ios_base::sync_with_stdio(0);
	int q;
	cin>>n>>q;
	int a,b;
	ll c;
	loop(i,0,n){
		cin>>Z[i];
	}
	loop(i,0,n){
		loop(j,0,n){
			C[i][j]=-1;
		}
	}
	loop(i,0,n-1){
		cin>>a>>b>>c;
		C[a-1][b-1]=c;
		C[b-1][a-1]=c;
		G[a-1].pb(b-1);
		G[b-1].pb(a-1);
	}
	int act=0;
	int t;
	ll d;
	loop(i,0,q){
		cin>>t;
		if(t==1){
			cin>>a>>d;
			Z[a-1]=d;
		}else{
			cin>>a>>b>>d;
			C[a-1][b-1]=d;
			C[b-1][a-1]=d;
		}
		loop(i,0,n){
			dist[i]=0;
		}
		dfs(act,-1);
		ll bc=-INFTY;
		int bi=0;
		loop(i,0,n){
			if(Z[i]-dist[i]>bc&&i!=act){
				bc=Z[i]-dist[i];
				bi=i;
			}
		}
		act=bi;
		ps(act+1);
	}
}