#include <stdio.h>

typedef long long ll;

int b[1000007], p[1000007], u[1000007], dp[1000007], right[1000007], left[1000007], umbrella[1000007];

inline int read(){
	int ans = 0;
	char ch = getchar();
	while (ch < '0' || ch > '9'){
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans;
}

inline int max(int a, int b){
	return a > b ? a : b;
}

inline int min(int a, int b){
	return a < b ? a : b;
}

void write(int n){
	if (n >= 10) write(n / 10);
	putchar(n % 10 + '0');
}

int main(){
	int n = read();
	ll ans = 0;
	for (register int i = 1; i <= n; i++){
		b[i] = read();
	}
	for (register int i = 1; i < n; i++){
		p[i] = read();
	}
	for (register int i = 1; i < n; i++){
		u[i] = read();
	}
	for (register int i = 1; i < n; i++){
		dp[i] = max(b[i] - max(p[i] - dp[i - 1], 0), 0);
	}
	for (register int i = n - 1; i >= 1; i--){
		right[i] = min(p[i], b[i + 1] - left[i + 1]);
		p[i] -= right[i];
		left[i] = min(p[i], dp[i]);
		p[i] -= left[i];
		umbrella[i] = min(p[i], u[i]);
		p[i] -= umbrella[i];
		ans += umbrella[i];
		left[i] += p[i];
		if (left[i] > b[i]){
			putchar('N');
			putchar('O');
			return 0;
		}
	}
	putchar('Y');
	putchar('E');
	putchar('S');
	putchar('\n');
	write(ans);
	putchar('\n');
	for (register int i = 1; i < n; i++){
		write(left[i]);
		putchar(' ');
		write(umbrella[i]);
		putchar(' ');
		write(right[i]);
		putchar('\n');
	}
	return 0;
}