#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f3f3f3f3LL;
const long long mod = (long long)1e9 + 7;
using namespace std;
template <class T>
void smin(T& a, T val) {
  if (a > val) a = val;
}
template <class T>
void smax(T& a, T val) {
  if (a < val) a = val;
}
const long long N = 2e3 + 100;
long long n;
vector<long long> x, y, c, k;
bool cp(long long x, long long y) { return c[x] < c[y]; }
struct UnionFind {
  vector<long long> parent, size;
  UnionFind(long long n) {
    parent.resize(n + 1);
    size.resize(n + 1);
    for (long long i = 0; i <= n; ++i) {
      parent[i] = i;
      size[i] = 1;
    }
  }
  long long find(long long x) {
    while (x != parent[x]) {
      parent[x] = parent[parent[x]];
      x = parent[x];
    }
    return x;
  }
  bool unite(long long x, long long y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (size[x] < size[y]) swap(x, y);
    size[x] += size[y];
    parent[y] = x;
    return true;
  }
  long long getSize(long long x) {
    x = find(x);
    return size[x];
  }
};
inline long long dist(long long idx1, long long idx2) {
  long long manh = abs(x[idx1] - x[idx2]) + abs(y[idx1] - y[idx2]);
  return (k[idx1] + k[idx2]) * manh;
}
vector<pair<long long, pair<long long, long long>>> edges;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  x.resize(n);
  y.resize(n);
  c.resize(n);
  k.resize(n);
  for (long long i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
  }
  for (long long i = 0; i < n; ++i) {
    cin >> c[i];
  }
  for (long long i = 0; i < n; ++i) {
    cin >> k[i];
  }
  for (long long i = 0; i < n; ++i) {
    for (long long j = 0; j < n; ++j) {
      if (i == j) continue;
      edges.push_back({dist(i, j), {i, j}});
    }
  }
  for (long long i = 0; i < n; ++i) {
    edges.push_back({c[i], {n, i}});
  }
  sort(edges.begin(), edges.end());
  UnionFind second(n);
  long long ans = 0;
  vector<long long> ans1;
  vector<pair<long long, long long>> ans2;
  for (auto it : edges) {
    long long wt = it.first;
    long long x = it.second.first, y = it.second.second;
    ;
    if (second.unite(x, y)) {
      ans += wt;
      if (x == n) {
        ans1.push_back(y);
      } else if (y == n) {
        ans1.push_back(x);
      } else {
        ans2.push_back({x, y});
      }
    }
  }
  cout << ans << '\n';
  cout << (long long)(ans1.size()) << '\n';
  for (auto i : ans1) {
    cout << i + 1 << ' ';
  }
  cout << '\n';
  cout << (long long)(ans2.size()) << '\n';
  for (auto i : ans2) {
    cout << i.first + 1 << ' ' << i.second + 1 << '\n';
    ;
  }
  return 0;
}
