#include<bits/stdc++.h>
using namespace std;
int n,m;
typedef long long ll;
ll p[500005];
struct edge{
	int to;
	ll val;
	edge(){}
	edge(int to_,int val_):to(to_),val(val_){}
};
vector<edge>G[500005];
ll ans=1,mx=0,mn=0;
int vis[500005],c[500005];
int k[500005];
ll b[500005];
int tmp[500005],id[500005];
int fl;
int pos;
void color(int x,int cl){
	tmp[++pos]=x;
	id[x]=pos;
	c[x]=cl;
	vis[x]=1;
	for(edge e:G[x]){
		if(vis[e.to]==0)color(e.to,-cl);
		else if(c[e.to]==cl)fl=0;
	}
}
void solve(int x){
	fl=1;
	pos=0;
	color(x,1);
	for(int i=1;i<=pos;i++)k[i]=0;
	k[1]=1,b[1]=0;
	if(fl){
		for(int i=1;i<=pos;i++)for(edge e:G[tmp[i]]){
			int v=id[e.to];
			if(k[v]==0)k[v]=-k[i],b[v]=e.val-b[i];
			else if(b[i]+b[v]!=e.val)ans=0;
		}
//		for(int i=1;i<=pos;i++)printf("%d %d %lld\n",tmp[i],k[i],b[i]);
		ll xmx=0x3f3f3f3f3f3f3f3f,xmn=0;
		for(int i=1;i<=pos;i++){
			if(k[i]==1)xmx=min(xmx,p[tmp[i]]-b[i]),xmn=max(xmn,-b[i]);
			else xmx=min(xmx,b[i]),xmn=max(xmn,b[i]-p[tmp[i]]);
		}
		ll sum1=0,sum2=0;
		for(int i=1;i<=pos;i++)sum1+=xmx*k[i]+b[i],sum2+=xmn*k[i]+b[i];
		if(xmx<xmn)ans=0;
		mx+=max(sum1,sum2),mn+=min(sum1,sum2);
	}
	else{
		ll vx=-1;
		for(int i=1;i<=pos;i++)for(edge e:G[tmp[i]]){
			int v=id[e.to];
			if(k[v]==0)k[v]=-k[i],b[v]=e.val-b[i];
			else if(k[i]!=k[v]){
				if(b[i]+b[v]!=e.val)ans=0;
			}
			else{
				if((e.val-b[i]-b[v])&1)ans=0;
				if(vx!=-1 && vx!=(e.val-b[i]-b[v])/(k[i]+k[v]))ans=0;
				else vx=(e.val-b[i]-b[v])/(k[i]+k[v]);
				if(vx<0)ans=0;
			}
		}
//		for(int i=1;i<=pos;i++)printf("%d %d %lld\n",tmp[i],k[i],b[i]);
//		printf("_ans=%d, vx=%d\n",ans,vx);
		for(int i=1;i<=pos;i++)b[i]+=k[i]*vx;
		for(int i=1;i<=pos;i++)if(b[i]<0 || b[i]>p[tmp[i]])ans=0;
		for(int i=1;i<=pos;i++)for(edge e:G[tmp[i]])if(b[i]+b[id[e.to]]!=e.val)ans=0;
		ll sum=0;
		for(int i=1;i<=pos;i++)sum+=b[i];
		mx+=sum,mn+=sum; 
	} 
//	printf("ans=%d\n",ans);
}
int read(){
	int x=0,c=getchar()-48;
	while(c<0 || c>9)c=getchar()-48;
	while(c>=0 && c<=9){
		x=x*10+c;
		c=getchar()-48;
	}
	return x;
}
int main(){
//	freopen("N537.in","r",stdin);
//	freopen("N537.out","w",stdout);
	n=read();
	m=read();
	for(int i=1;i<=n;i++)p[i]=read();
	ll tot=0;
	for(int i=1;i<=n;i++)tot+=p[i];
	for(int i=1;i<=m;i++){
		int u=read();
		int v=read();
		int w=read();
		G[u].push_back(edge(v,w));
		G[v].push_back(edge(u,w));
//		printf("connect %d %d %d\n",u,v,w);
	}
	for(int i=1;i<=n;i++)if(vis[i]==0)solve(i);
	if(ans==0)printf("NIE");
	else printf("%lld %lld\n",tot-mx,tot-mn);
	return 0;
	//quod erat demonstrandum
}