Cod sursă (job #369153)

#include<bits/stdc++.h>
#define NMAX 810
using namespace std;

vector<int>V[NMAX];
int rs,p,n,m;
bool viz[NMAX];
int b[NMAX];

void DFS(int x) {
	viz[x]=1;rs=max(rs,b[x]);
	for (int i=0; i<V[x].size(); i++) {
		if (!viz[V[x][i]]) {
			DFS(V[x][i]);
		}
	}
}

int main() {
	ifstream cin("dragoni2.in");
	ofstream cout("dragoni2.out");
	cin>>p>>n>>m;
	if (p==2) {
		return 0;
	}
	for (int i=1; i<=n; i++) {
		cin>>b[i];
	}
	
	for (int i=1; i<=m; i++) {
		int x,y,c; cin>>x>>y>>c;
		if (c>b[1]) continue;
		else{
			V[x].push_back(y);
			V[y].push_back(x);
		}
	}
	
	DFS(1);
	cout<<rs;
	
	return 0;
}