#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> cor;
vector<ll> c, k;
ll dist(ll i, ll j) {
  ll res =
      abs(cor[i].first - cor[j].first) + abs(cor[i].second - cor[j].second);
  res *= k[i] + k[j];
  return res;
}
struct dsu {
  vector<ll> pred, rank;
  vector<pair<ll, ll>> edge;
  ll cost;
  ll cnt_root;
  void init(ll n) {
    pred.resize(n + 1);
    rank.resize(n + 1);
    cost = 0;
    cnt_root = n;
    for (ll i = 1; i <= n; i++) {
      pred[i] = i;
      cost += c[i];
      rank[i] = c[i];
    }
  }
  ll find(ll v) { return (v == pred[v] ? v : pred[v] = find(pred[v])); }
  void merge(ll ru, ll rv, ll price) {
    ll u = find(ru);
    ll v = find(rv);
    if (u == v) return;
    if (rank[u] > rank[v]) swap(u, v);
    if (cost - rank[v] + price >= cost) return;
    cost = cost - rank[v] + price;
    pred[v] = u;
    edge.push_back({ru, rv});
    cnt_root--;
  }
} mst;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ll n;
  cin >> n;
  cor.resize(n + 1);
  k.resize(n + 1);
  c.resize(n + 1);
  for (ll i = 1; i <= n; i++) {
    cin >> cor[i].first >> cor[i].second;
  }
  for (ll i = 1; i <= n; i++) {
    cin >> c[i];
  }
  for (ll i = 1; i <= n; i++) {
    cin >> k[i];
  }
  mst.init(n);
  vector<pair<ll, ll>> e;
  for (ll i = 1; i <= n; i++) {
    for (ll j = i + 1; j <= n; j++) {
      e.push_back({i, j});
    }
  }
  sort(e.begin(), e.end(), [](const pair<ll, ll>& x, const pair<ll, ll>& y) {
    return (dist(x.first, x.second) < dist(y.first, y.second));
  });
  for (const pair<ll, ll>& i : e) {
    mst.merge(i.first, i.second, dist(i.first, i.second));
  }
  cout << mst.cost << "\n";
  cout << mst.cnt_root << "\n";
  for (ll i = 1; i <= n; i++) {
    if (mst.find(i) == i) cout << i << " ";
  }
  cout << "\n";
  cout << mst.edge.size() << "\n";
  for (const pair<ll, ll>& i : mst.edge) {
    cout << i.first << " " << i.second << "\n";
  }
  return 0;
}
