#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;

#define all(x) x.begin(), x.end()

const char nd = '\n';

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  //

  ll n;
  cin >> n;

  vl b(n);
  for (auto &v : b) cin >> v;

  vl p(n, 0);
  for (ll i = 0; i + 1 < n; i++) cin >> p[i];

  vl u(n, 0);
  for (ll i = 0; i + 1 < n; i++) cin >> u[i];

  vl used(n, 0), market(n, 0);

  bool can = true;
  ll free = 0;

  for (ll i = n - 1; i >= 0; i--) {
    used[i] = max(p[i] - free, 0LL);
    if (used[i] <= b[i]) {
      free = b[i] - used[i];
    } else {
      can = false;
      break;
    }
  }

  if (!can) {
    cout << "NO" << nd;
    return 0;
  }

  cout << "YES" << nd;

  cout << 0 << nd;

  for (ll i = 0; i + 1 < n; i++) {
    cout << used[i] << " " << market[i] << " " << p[i] - used[i] - market[i]
         << nd;
  }
}