#include<bits/stdc++.h>
#define M 3000005
#define N 500005
#define int long long
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,m,mx,mn;
struct edge
{
	int u,v,w;
}e[M];
struct fig
{
	int to,next,w;
}k[M*2];int head[N],tot=1;
bool vis[N],pos[M];
void add(int from,int to,int w)
{
	k[++tot].to=to;
	k[tot].w=w;
	k[tot].next=head[from];
	head[from]=tot;
}
int dep[N],val[N],p[N],ans[N];
struct pt
{
	int b,k;
	void clen()
	{
		b=0;
		k=0;
	}
	pt operator +(pt a)
	{
		pt c;c.clen();
		c.b=a.b+b;
		c.k=a.k+k;
		return c;
	}
	pt operator -(pt a)
	{
		pt c;c.clen();
		c.b=b-a.b;
		c.k=k-a.k;
		return c;
	}
}s[N],sum;
void dfs(int now,int f)
{
	dep[now]=dep[f]+1;vis[now]=1;
	for(int i=head[now];i;i=k[i].next)
	{
		if(k[i].to==f||vis[k[i].to])continue;
		pos[i>>1]=1;
		val[k[i].to]=k[i].w-val[now]; 
		dfs(k[i].to,now);
	}
}
void solve(int now,int f)
{
	if(ans[now]<0||ans[now]>p[now])
	{
		cout<<"NIE\n";
		exit(0);
	}
	vis[now]=1;mx+=ans[now];mn+=ans[now]; 
	for(int i=head[now];i;i=k[i].next)
	{
		if(k[i].to==f||!pos[i>>1])continue;
		ans[k[i].to]=k[i].w-ans[now];
		solve(k[i].to,now); 
	}
}
int l,r; 
void get(int now,int f)
{
	vis[now]=1;
	int pl=0,pr=p[now];
	pl-=s[now].b;pr-=s[now].b;
	sum=sum+s[now];
	if(s[now].k==1)
	{
		l=max(pl,l);
		r=min(pr,r);
	}
	else
	{
		l=max(l,-1*pr);
		r=min(r,-1*pl);
	}
	for(int i=head[now];i;i=k[i].next)
	{
		if(k[i].to==f||!pos[i>>1])continue;
		pt p={k[i].w,0};p=p-s[now];
		s[k[i].to]=p;
		get(k[i].to,now);
	}
 } 
signed main()
{
	n=read();m=read();int sup=0;
	for(int i=1;i<=n;i++)p[i]=read(),sup+=p[i];
	for(int i=1;i<=m;i++)
	{
		e[i].u=read();
		e[i].v=read();
		e[i].w=read(); 
		add(e[i].u,e[i].v,e[i].w);
		add(e[i].v,e[i].u,e[i].w);
	}
	for(int i=1;i<=n;i++)if(!vis[i])dfs(i,0); 
	memset(vis,0,sizeof(vis));
	for(int i=1;i<=m;i++)
	{
		if(!pos[i])
		{
			if(dep[e[i].u]>dep[e[i].v])swap(e[i].u,e[i].v);
			int u=e[i].u,v=e[i].v;
			if((dep[v]-dep[u])%2)
			{
				if(e[i].w!=val[v]+val[u])
				{
					cout<<"NIE\n";
					return 0;
				}
			}
			else
			{
				int w=e[i].w-val[v]+val[u];
				if(w%2)
				{
					cout<<"NIE\n";
					return 0;
				}
				if(!vis[u])
				{
					ans[u]=w/2;
					solve(u,0); 
				}
				else
				{
					if(ans[u]!=w/2)
					{
						cout<<"NIE\n";
						return 0;
					}
				}
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			s[i].b=0;
			s[i].k=1;
			l=0;r=p[i];
			sum.clen(); 
			get(i,0);
			mx+=max(sum.b+sum.k*l,sum.b+sum.k*r);
			mn+=min(sum.b+sum.k*l,sum.b+sum.k*r);
			if(l>r)
			{
				cout<<"NIE\n";
				return 0;
			}
		}
	}
	cout<<sup-mx<<" "<<sup-mn<<"\n";
	return 0;
}