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
//#include <stdio.h>
#include <bits/stdc++.h>
//#include <ctime>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

typedef pair<LL,LL> PLL;
typedef vector <PLL> VPLL;

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define MP make_pair
#define PF push_front

const int maxn=1e5+5;
const LL MINF=-(1e18);
int n,q;
int a,b;
LL c;
int typ;
unordered_map <int, LL> cost[maxn];
LL pluz[maxn];
VI g[maxn];
bitset <maxn> v;
bool bit=0;
int pos,vet;
LL wyn,ret;
LL koszt;
void dfs(int x)
{
	v[x]=bit;
	for(int w : g[x])
	{
		if(v[w]!=bit)
		{
			koszt+=cost[x].at(w);
			if( (pluz[w]-koszt)>ret )
			{
				ret=pluz[w]-koszt;
				vet=w;
			}
			else if( (pluz[w]-koszt)==ret && w<vet)
			{
				vet=w;
			}
			dfs(w);
			koszt-=cost[x].at(w);
		}
	}
}
int main()
{
	scanf("%d %d", &n, &q);
	FOR(i,1,n)
	{
		scanf("%lld", &pluz[i]);
	}
	REP(i,n-1)
	{
		scanf("%d %d %lld", &a, &b, &c);
		cost[a][b]=c;
		cost[b][a]=c;
		g[a].PB(b);
		g[b].PB(a);
	}
	pos=1;
	
	REP(i,q)
	{
		scanf("%d", &typ);
		if(typ==1)
		{
			scanf("%d %lld", &a, &c);
			pluz[a]=c;
		}
		else
		{
			scanf("%d %d %lld", &a, &b , &c);
			cost[a][b]=c;
			cost[b][a]=c;
		}
		bit^=1;
		koszt=0;
		vet=n+10;
		ret=MINF;
		dfs(pos);
		pos=vet;
		printf("%d ",pos);
	}	
	printf("\n");
	return 0;

}