#include<bits/stdc++.h>
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define int long long
#define mod (1000000007)
// int mod;
#ifndef ONLINE_JUDGE
#pragma GCC optimize(2)
#endif
using namespace std;
namespace IO{
	inline int read(){
		int n=0;
		int s=1;
		char x;
		while((x=getchar())<'0'||x>'9')
			if(x=='-')
				s=-1;
		while(x>='0'&&x<='9'){
			n=(n<<1)+(n<<3)+(x^48),
			x=getchar();
		}
		return n*s;
	}
	void write(char x){
		putchar(x);
	}
	void write(const char *x){
		for(;*x;++x)
			putchar(*x);
	}
	void write(char *x){
		for(;*x;++x)
			putchar(*x);
	}
	void write(signed x){
		if(x<0)putchar('-'),x=-x;
		if(x>9)write(x/10);
		putchar('0'+x-x/10*10);
	}
	void write(long long x){
		if(x<0)putchar('-'),x=-x;
		if(x>9)write(x/10);
		putchar('0'+x-x/10*10);
	}
	void write(double x){
		printf("%lf",x);
	}
	template<typename type1,typename type2,typename ...typen>
	void write(type1 a1,type2 a2,typen ...an){
		write(a1);
		write(a2,an...);
	}
}// namespace IO
inline long long max(long long a,long long b){return a>b?a:b;}
inline long long min(long long a,long long b){return a>b?b:a;}
inline signed max(signed a,signed b){return a>b?a:b;}
inline signed min(signed a,signed b){return a>b?b:a;}
// stop
int b[1000001];
int p[1000001],u[1000001];
int l[1000001],m[1000001],r[1000001];
// #define wtf
signed main(){
	using namespace IO;
	// define int long long
	// mod = 1000000007
	#ifdef wtf
	string filename="name";
	freopen((filename+".in").c_str(),"r",stdin);
	freopen((filename+".out").c_str(),"w",stdout);
	#endif
	int n=read();
	for(int i=1;i<=n;i++)b[i]=read();
	for(int i=1;i<n;i++)p[i]=read();
	for(int i=1;i<n;i++)u[i]=read();
	for(int i=1;i<n;i++)m[i]=min(p[i],u[i]);
	for(int i=1;i<n;i++){
		int last=b[i]-r[i-1];
		int mor=p[i]-m[i];
		if(last>=mor)l[i]=mor,r[i]=0;
		else if(b[i+1]<mor-last){
			puts("NO");
			return 0;
		}
		else l[i]=last,r[i]=mor-last;
	}
	for(int i=n-1;i>=1;i--){
		int last=b[i+1]-l[i+1]-r[i];
		int x=r[i];
		if(m[i]>last)r[i]=x+last,m[i]-=last;
		else if(m[i]+l[i]>last)r[i]=x+last,l[i]-=last-m[i],m[i]=0;
		else r[i]=m[i]+l[i]+x,l[i]=m[i]=0;
	}
	for(int i=1;i<n;i++){
		int last=b[i]-r[i-1]-l[i];
		int x=l[i];
		if(m[i]>last)l[i]=x+last,m[i]-=last;
		else if(m[i]+r[i]>last)l[i]=x+last,r[i]-=last-m[i],m[i]=0;
		else l[i]=m[i]+r[i]+x,m[i]=r[i]=0;
	}
	puts("YES");
	int sum=0;
	for(int i=1;i<n;i++)sum+=m[i];
	write(sum,'\n');
	for(int i=1;i<n;i++)write(l[i],' ',m[i],' ',r[i],'\n');
	return 0;
}
/*
  ----  ----
   ----  ----
    ----  ----
    ----  ----
                       ----
               ----
         ----
    ----
                        ----
                 ----
          ----
   ----
                        ----
                 ----
            ----
      ----
                          ----
                ----
          ----
    ----
                          ----
                  ----
           ----
     ----

                     ----   ----

                     ----   ----

    ----   ----

    ----   ----

----------------------------------------
*/