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
226
227
228
229
#include <iostream>
#include <vector>
#include <stack>
#include <cassert>
#include <algorithm>
#include <queue>

using namespace std;

const int max_nodes = 100002;

struct t_edge {
        long long cost;
        int dest;
};

enum colour { White, Black, Gray};

struct t_node {
        int n;
        colour c;
        long long d;
        long long z;
        vector<t_edge*> edges;
};

//class t_edge_cmp {
//public:
        bool edge_cmp(const t_edge *l, const t_edge *r)
        {
                return l->dest < r->dest;
        }
//};


int n, q;
t_node node_tab[max_nodes];
int cur_n;

void init_node_tab()
{
        for(int i = 1; i <= n; ++i) {
                node_tab[i].n = i;
        }
}

void print_node_tab()
{
        for(int i = 1; i <= n; ++i) {
                cout << i << ":";
                vector<t_edge*>::iterator it;

                for(it = node_tab[i].edges.begin(); it != node_tab[i].edges.end(); ++it) {
                        cout << " " << (*it)->dest << "(" << (*it)->cost << ")";
                }
                cout << endl;
        }
}

int c[max_nodes];

void my_sort(vector<t_edge*> &v)
{
        int s = v.size();

        if (s < 2) {
                return;
        }

        if (s == 2) {
                if (v[0]->dest > v[1]->dest) {
                        struct t_edge *tmp = v[0];
                        v[0] = v[1];
                        v[1] = tmp;
                }
                return;
        }

        //v.size() > 2
        if (s < 5000) {
                sort(v.begin(), v.end(), edge_cmp);
                return;
        }

        // count sort
        vector<t_edge*> x;
        vector<t_edge*>::iterator it;

        for(it = v.begin(); it != v.end(); ++it) {
                x.push_back( (*it) );
        }

        for(int i = 1; i <= n; ++i) {
                c[i] = 0;
        }

        for(int i = 0; i < s; ++i) {
                c[v[i]->dest]++;
        }

        for(int i = 2; i <= n; ++i) {
                c[i] += c[i-1];
        }

        for(int i = 1; i <= n; ++i) {
                c[i]--;
        }

        for(int i = s-1; i >= 0; --i) {
                v[c[x[i]->dest]] = x[i];
        }
}

int bfs(int s)
{
        queue<t_node*> q;
        int next_node=n;
        long long max_z = node_tab[node_tab[s].edges[0]->dest].z - node_tab[s].edges[0]->cost - 1;


        for(int i = 1; i <= n; ++i) {
                node_tab[i].d = 0;
                node_tab[i].c = colour::White;
        }
        node_tab[s].c = colour::Gray;
        node_tab[s].d = 0;
//        cout << "node " << s << " has " << node_tab[s].edges.size() << " edges\n";
        q.push( &node_tab[s] );
        while (!q.empty()) {
                t_node *u = q.front();
                for(int i = 0; i < u->edges.size(); ++i) {
                        t_node *adj = &node_tab[u->edges[i]->dest];
                        if (adj->c == colour::White) {
                                long long z;
                                adj->c = colour::Gray;
                                adj->d = u->d + u->edges[i]->cost;
                                z = adj->z - adj->d;
                                if (z > max_z || (z == max_z && adj->n < next_node)) {
                                        max_z = z;
                                        next_node = adj->n;
                                }

//                               cout << "path len from " << s << "(" << node_tab[s].n << ") to " << adj->n << " = " << adj->d << " z = " << z << endl;
                                q.push( adj );
                        }
                }
                u->c = colour::Black;
                q.pop();
        }
        return next_node;
}

int main()
{
        cin >> n >> q;

        init_node_tab();
        cur_n = 1;
        for(int i = 1; i <= n; ++i) {
                cin >> node_tab[i].z;
        }

        for(int i = 1; i < n; ++i) {
                int a, b;
                long long c;
                cin >> a >> b;
                cin >> c;
                auto edge = new t_edge;
                edge->dest = b;
                edge->cost = c;
                node_tab[a].edges.push_back(edge);
                edge = new t_edge;
                edge->dest = a;
                edge->cost = c;
                node_tab[b].edges.push_back(edge);
        }

//        print_node_tab();

//        for(int i = 1; i <= n; ++i) {
//                my_sort(node_tab[i].edges);
//        }

//        print_node_tab();

        cur_n = 1;
        for(int i = 0; i < q; ++i) {
                int chg_type;

                cin >> chg_type;

                if (chg_type == 1) {
                        int v;
                        long long d;

                        cin >> v;
                        cin >> d;
                        node_tab[v].z = d;
                } else {
                        int a, b;
                        long long d;
                        vector<t_edge*> *v;

                        cin >> a >> b;
                        cin >> d;
                        v = &node_tab[a].edges;
                        for(int i = 0; i < v->size(); ++i) {
                                if ((*v)[i]->dest == b) {
                                        (*v)[i]->cost = d;
                                }
                        }
                        v = &node_tab[b].edges;
                        for(int i = 0; i < v->size(); ++i) {
                                if ((*v)[i]->dest == a) {
                                        (*v)[i]->cost = d;
                                }
                        }

                }
                cur_n = bfs(cur_n);
                if (i > 0) {
                        cout << " ";
                }
                cout << cur_n;
        }
        cout << endl;

        return 0;
}