#include <bits/stdc++.h>
using namespace std;
inline int64_t max(int64_t a, int64_t b) { return (a > b) ? a : b; }
inline int64_t min(int64_t a, int64_t b) { return (a < b) ? a : b; }
inline int64_t max3(int64_t a, int64_t b, int64_t c) {
  return max(a, max(b, c));
}
inline int64_t min3(int64_t a, int64_t b, int64_t c) {
  return min(a, min(b, c));
}
int64_t gcd(int64_t a, int64_t b) { return (a % b == 0) ? b : gcd(b, a % b); }
int64_t pow3(int64_t a, int64_t b, int64_t m = 1000000007) {
  int64_t res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    a = (a * a) % m;
    b >>= 1;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int q = 1;
  while (q--) {
    int64_t n;
    cin >> n;
    int64_t x[n], y[n];
    int64_t k[n], c[n];
    for (int64_t i = 0; i < n; i++) cin >> x[i] >> y[i];
    for (int64_t i = 0; i < n; i++) cin >> c[i];
    for (int64_t i = 0; i < n; i++) cin >> k[i];
    vector<int64_t> pp;
    vector<pair<int64_t, int64_t> > con;
    int64_t cost[n][n];
    bool vis[n];
    for (int64_t i = 0; i < n; i++) vis[i] = false;
    int64_t p[n];
    for (int64_t i = 0; i < n; i++) p[i] = -1;
    int64_t ans = 0;
    for (int64_t i = 0; i < n; i++)
      for (int64_t j = i; j < n; j++)
        cost[j][i] = cost[i][j] =
            (k[i] + k[j]) * (abs(x[i] - x[j]) + abs(y[i] + y[j]));
    for (int64_t j = 0; j < n; j++) {
      int64_t tans = 1e18;
      int64_t mi = -1;
      for (int64_t i = 0; i < n; i++)
        if (!vis[i] && tans > c[i]) {
          tans = c[i];
          mi = i;
        }
      ans += tans;
      vis[mi] = true;
      if (p[mi] == -1)
        pp.push_back(mi);
      else
        con.push_back(make_pair(p[mi], mi));
      for (int64_t i = 0; i < n; i++) {
        if (c[i] > (k[i] + k[mi]) * (abs(x[i] - x[mi]) + abs(y[i] - y[mi]))) {
          c[i] = (k[i] + k[mi]) * (abs(x[i] - x[mi]) + abs(y[i] - y[mi]));
          p[i] = mi;
        }
      }
    }
    cout << ans << endl << pp.size() << endl;
    for (int64_t i = 0; i < pp.size(); i++) cout << pp[i] + 1 << " ";
    cout << endl << con.size() << endl;
    for (int64_t i = 0; i < con.size(); i++)
      cout << con[i].first + 1 << " " << con[i].second + 1 << endl;
  }
  return 0;
}
