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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

//defmodfact
const int COMinitMAX = 998244;
mint fact[COMinitMAX+1], factinv[COMinitMAX+1];

void modfact(){
	fact[0] = 1;
	for (int i=1; i<=COMinitMAX; i++){
		fact[i] = fact[i-1] * i;
	}
	factinv[COMinitMAX] = fact[COMinitMAX].inv();
	for (int i=COMinitMAX-1; i>=0; i--){
		factinv[i] = factinv[i+1] * (i+1);
	}
}

mint cmb(int a, int b){
	if (a<b || b<0) return mint(0);
	return fact[a]*factinv[b]*factinv[a-b];
}
//--------


int main(){
	modfact();
	int n, m; cin >> n >> m;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];
	
	vector<int> u(m), v(m);
	vector<ll> c(m);
	rep(i,0,m){
		cin >> u[i] >> v[i];
		u[i]--;
		v[i]--;
		cin >> c[i];
		c[i] -= a[v[i]];
	}

	vector<ll> d(n,1e18);
	d[0] = -a[0];
	ll memo1 = 0;
	ll memo2 = 0;
	rep(i,0,3*m+1){
		rep(j,0,m){
			chmin(d[v[j]], d[u[j]] + c[j]);
		}
		if (i == m){
			memo1 = d[n-1];
		}else if(i == 3*m){
			memo2 = d[n-1];
		}
	}
	if (memo1 > memo2){
		cout << "inf" << '\n';
	}else{
		cout << -memo2 << '\n';
	}
}