#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

int a[N], b[N], c[N], f[N];

signed main() {
    int n; scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = 1; i < n; ++i) scanf("%d", &b[i]);
    for (int i = 1; i < n; ++i) scanf("%d", &c[i]);
    f[n] = a[n];
    for (int i = n - 1; i >= 1; --i) {
        f[i] = a[i] - max(b[i] - c[i] - f[i + 1], 0);
        if (f[i] < 0) return 0 & puts("NO");
    }
    vector< array<int, 3> > res;
    for (int i = 1; i < n; ++i) {
        int t = max(min(b[i] - a[i], f[i + 1]), 0);
        res.push_back({a[i], b[i] - a[i] - t, t});
        a[i + 1] -= t;
    }
	long long S = 0;
	for_each(res.begin(), res.end(), [&](auto x) { S += x[1]; });
	puts("YES"), printf("%lld\n", S);
	for (auto [x, y, z] : res) printf("%d %d %d\n", x, y, z);
    return 0;
}