avançado-48.cpp

#include <bits/stdc++.h>
#define MAXN 100010
using namespace std;

int n, m, pontos[MAXN], comp[MAXN];

inline int find(int x)
{
	if(comp[x] == x) return x;
	return comp[x] = find(comp[x]);
}

inline void join(int a, int b)
{
	comp[find(a)] = find(b);
}

int main()
{
	cin >> n >> m;
	for(int i = 0 ; i < n ; i++)
	{
		cin >> pontos[i];
		comp[i] = i;
	}
	int cont = 0;
	for(int i = 0 ; i < m ; i++)
	{
		int q, a, b;
		cin >> q >> a >> b;
		if(q == 1)
		{
			pontos[find(b)] += pontos[find(a)];
			join(a, b);
		}
		else
		{
			if(find(1) == find(a) and pontos[find(a)] > pontos[find(b)]) cont++;
			else if(comp[1] == comp[b] and pontos[comp[b]] > pontos[comp[a]]) cont++;
		}
	}
	cout << cont << endl;
}