#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    int N,M;
    cin>>N>>M;
    vector<ll> A(N);
    rep(i,0,N) cin>>A[i];
    struct edge{
        int to;
        ll cost;
    };
    vector<vector<edge>> G(N*2);
    vector<int> seen(N*2);
    vector<int> order={0};
    rep(i,0,N){
        G[i].push_back({i+N,-A[i]});
    }
    rep(i,0,M){
        int a,b;
        ll c;
        cin>>a>>b>>c;
        a--,b--;
        G[a+N].push_back({b,c});
    }
    vector<int> P(N*2);
    vector<ll> dp(N*2,ILL);
    dp[0]=0;
    rep(rp,0,6*N){
        rep(i,0,N*2) for(auto x:G[i]){
            if(chmin(dp[x.to],dp[i]+x.cost)){
                if(rp>=3*N){
                    P[x.to]=1;
                }
            }
        }
    }
    rep(i,0,N*2) if(P[i]==1){
        order.push_back(i);
        dp[i]=-ILL;
    }
    rep(i,0,order.size()){
        int a=order[i];
        for(auto x:G[a]) if(dp[x.to]!=-ILL){
            dp[x.to]=-ILL;
            order.push_back(x.to);
        }
    }
    ll ans=-dp[N*2-1];
    if(ans==ILL) cout<<"inf\n";
    else cout<<ans<<"\n";
}