#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7, INF = 1e18;
const double eps = 1e-8;
template <class T>
inline T Min(const T& a, const T& b) {
  return a < b ? a : b;
}
template <class T>
inline T Max(const T& a, const T& b) {
  return a < b ? b : a;
}
inline int read() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline long long int readl() {
  char ch = getchar();
  long long int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline double readf() {
  char ch = getchar();
  double x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  bool flag = false;
  double bit = 0.1;
  while ('0' <= ch && ch <= '9') {
    if (!flag)
      x = x * 10 + ch - '0';
    else
      x += bit * (ch - '0'), bit *= 0.1;
    ch = getchar();
    if (ch == '.') {
      flag = true, ch = getchar();
    }
  }
  return x * f;
}
inline long long int ksm(long long int a, long long int b) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return res;
}
inline long long int ksc(long long int a, long long int b) {
  long long int res = 0;
  while (b) {
    if (b & 1) res = res + a >= MOD ? res + a - MOD : res + a;
    a = a + a >= MOD ? a + a - MOD : a + a;
    b >>= 1;
  }
  return res;
}
inline double fixed(const double& x) {
  if (fabs(x) <= eps) return 0;
  return x;
}
const int N = 1e6 + 7;
struct node {
  int to, last;
  long long int w;
  node(int to, long long int w, int last) : to(to), w(w), last(last){};
  bool operator<(const node& tmp) const { return w > tmp.w; }
};
long long int x[N], y[N], dis[N], k[N];
bool vis[N];
long long int fun(int u, int v) {
  return 1ll * (abs(x[u] - x[v]) + abs(y[u] - y[v])) * (k[u] + k[v]);
}
int main() {
  int n = read();
  priority_queue<node> Q;
  for (int i = 1; i <= n; i++) x[i] = read(), y[i] = read();
  for (int i = 1; i <= n; i++) dis[i] = readl(), Q.push(node(i, dis[i], i));
  for (int i = 1; i <= n; i++) k[i] = readl();
  vector<int> p;
  vector<pair<int, int> > e;
  while (Q.size()) {
    node now = Q.top();
    Q.pop();
    if (vis[now.to]) continue;
    vis[now.to] = true;
    if (now.to == now.last)
      p.push_back(now.to);
    else
      e.push_back(pair<int, int>(now.to, now.last));
    for (int i = 1; i <= n; i++) {
      if (vis[i] || i == now.to) continue;
      long long int w = fun(i, now.to);
      if (dis[i] >= w) {
        dis[i] = w;
        Q.push(node(i, dis[i], now.to));
      }
    }
  }
  long long int res = 0;
  for (int i = 0; i < p.size(); i++) res += dis[p[i]];
  for (int i = 0; i < e.size(); i++) res += fun(e[i].first, e[i].second);
  cout << res << endl;
  printf("%d\n", p.size());
  for (int i = 0; i < p.size(); i++) printf("%d ", p[i]);
  printf("\n");
  printf("%d\n", e.size());
  for (int i = 0; i < e.size(); i++) printf("%d %d\n", e[i].first, e[i].second);
  return 0;
}
