#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f3f3f3f3f

#define mod 998244353

int n,m,a[maxn],dis[maxn],dep[maxn],out,sumd[maxn];
vector<pii>e[maxn];

int res[maxn][20];
int to[20][20],tmp[20][20][20],id[20];
bool vis[20];
void dij(int u,int*d){
	memset(vis,0,sizeof vis);
	while(1){
		int x=-1,mn=inf;
		For(i,1,dep[u]) if(!vis[i]&&d[i]<mn) mn=d[i],x=i;
		if(x==-1)break;
		vis[x]=1;
		For(i,1,dep[u]) d[i]=min(d[i],d[x]+to[x][i]);
	}
}
void solve(int u)
{
	For(i,1,n)For(j,1,n)tmp[dep[u]][i][j]=to[i][j];
	for(auto it:e[u]){
		int v=dep[it.fi],w=it.se;
		to[dep[u]][v]=min(to[dep[u]][v],w);
	}
	memset(res[u],63,sizeof res[u]);
	res[u][dep[u]]=0;
	if(u*2<(1<<n)){
		to[dep[u]][dep[u]+1]=a[u*2];
		solve(u*2);
		to[dep[u]][dep[u]+1]=a[u*2+1];
		solve(u*2+1);
		For(i,1,dep[u]-1) res[u][i]=min(res[u*2][i]+a[u*2],res[u*2+1][i]+a[u*2+1]);
	}
	dij(u,res[u]);
	For(i,1,n)For(j,1,n)to[i][j]=tmp[dep[u]][i][j];
}
void dfs2(int u){
	Rep(i,dep[u]-1,1){
		Rep(j,dep[u]-1,i+1){
			res[u][i]=min(res[u][i],res[u][j]+res[id[j]][i]);
		}
	}
	if(u*2<(1<<n)){
		id[dep[u]]=u;
		dfs2(u*2);
		dfs2(u*2+1);
	}
}
void dfs3(int u){
	For(i,1,dep[u]-1){
		if(res[u][i]<inf){
			out+=(res[u][i]%mod)*(1ll<<(n-i))%mod;
			out+=(sumd[id[i]]%mod);
			out=(out-((1ll<<(n-i))-1)*(dis[id[i]/2]%mod)%mod+mod)%mod;
		}
	}
	if(u*2>=(1<<n))return;
	id[dep[u]]=u*2+1;
	dfs3(u*2);
	id[dep[u]]^=1;
	dfs3(u*2+1);
}

signed main()
{
	n=read(),m=read();
	dep[1]=1;
	For(i,2,(1<<n)-1){
		a[i]=read();
		dep[i]=dep[i>>1]+1;
		dis[i]=dis[i>>1]+a[i];
	}
	Rep(i,(1<<n)-1,1){
		sumd[i]=dis[i]%mod;
		if(i*2<=(1<<n)-1){
			sumd[i]=(sumd[i]+sumd[i*2]+sumd[i*2+1])%mod;
		}
	}
	For(i,1,m){
		int u=read(),v=read(),w=read();
		if(u==v)continue;
		e[v].pb(mkp(u,w));
	}
	memset(to,63,sizeof to);
	solve(1),dfs2(1),dfs3(1);
	For(i,1,(1<<n)-1){
		int u=i/2;
		while(u){
			out=(out+dis[i]-dis[u]+mod)%mod;
			u/=2; 
		}
	}
	cout<<out;
    return 0;
}