#include <bits/stdc++.h>
using namespace std;
long long x[2005], y[2005], k[2005], vis[2005], co[2005], id, mm, ara[2005],
    sz[2005];
vector<pair<long long, long long> > e;
priority_queue<pair<long long, pair<long long, long long> >,
               vector<pair<long long, pair<long long, long long> > >,
               greater<pair<long long, pair<long long, long long> > > >
    q;
priority_queue<pair<long long, pair<long long, long long> > > q2;
vector<long long> v;
set<pair<long long, long long> > st;
set<long long> g[2005];
set<long long>::iterator it2;
;
set<pair<long long, long long> >::iterator it;
long long concost(long long i, long long j) {
  return (k[j] + k[i]) * (llabs(x[i] - x[j]) + llabs(y[i] - y[j]));
}
void dfs(long long u, long long p) {
  if (p == -1) {
    id = u;
    mm = co[u - 1];
  }
  if (mm > co[u - 1]) {
    id = u;
    mm = co[u - 1];
  }
  if (vis[u]) {
    mm = 0;
    id = -1;
  }
  for (auto chi : g[u]) {
    if (chi != p) {
      dfs(chi, u);
    }
  }
}
void initset(long long n) {
  for (long long i = 1; i <= n; i++) {
    ara[i] = i;
    sz[i] = 1;
  }
}
long long findset(long long i) {
  if (ara[i] == i) return i;
  return ara[i] = findset(ara[i]);
}
bool issameset(long long i, long long j) { return (findset(i) == findset(j)); }
void unionset(long long i, long long j) {
  long long a = findset(j);
  long long b = findset(i);
  if (a == b) return;
  if (sz[a] >= sz[b]) {
    sz[a] += sz[b];
    ara[b] = a;
  } else {
    sz[b] += sz[a];
    ara[a] = b;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  while (cin >> n) {
    memset(vis, 0, sizeof vis);
    initset(n);
    for (long long i = 0; i < n; i++) {
      cin >> x[i] >> y[i];
    }
    long long m = 1e18 + 19, idx = -1;
    for (long long i = 0; i < n; i++) {
      cin >> co[i];
      if (co[i] < m) {
        m = co[i];
        idx = i + 1;
      }
    }
    for (long long i = 0; i < n; i++) {
      cin >> k[i];
    }
    for (long long i = 0; i < n; i++) {
      for (long long j = i + 1; j < n; j++) {
        if (i == j) continue;
        q.push(make_pair(concost(i, j), make_pair(i + 1, j + 1)));
      }
    }
    long long ans = 0;
    while (!q.empty()) {
      pair<long long, pair<long long, long long> > p = q.top();
      q.pop();
      if (!issameset(p.second.second, p.second.first)) {
        unionset(p.second.second, p.second.first);
        q2.push(p);
        g[p.second.second].insert(p.second.first);
        g[p.second.first].insert(p.second.second);
        ans += p.first;
      }
    }
    v.push_back(idx);
    ans += m;
    vis[idx] = 1;
    while (!q2.empty()) {
      pair<long long, pair<long long, long long> > p = q2.top();
      q2.pop();
      long long tmp;
      g[p.second.second].erase(p.second.first);
      g[p.second.first].erase(p.second.second);
      dfs(p.second.first, -1);
      long long a = mm;
      if (id != -1) tmp = id;
      dfs(p.second.second, -1);
      long long b = mm;
      if (id != -1) tmp = id;
      if (a + b <= p.first) {
        ans -= p.first;
        ans += a + b;
        vis[tmp] = 1;
        v.push_back(tmp);
      } else {
        g[p.second.second].insert(p.second.first);
        g[p.second.first].insert(p.second.second);
        e.push_back(p.second);
      }
    }
    cout << ans << endl;
    cout << ((long long)(v.size())) << endl;
    for (auto u : v) cout << u << " ";
    cout << endl;
    v.clear();
    cout << ((long long)(e.size())) << endl;
    for (auto u : e) cout << u.first << " " << u.second << endl;
    cout << endl;
    e.clear();
    for (long long i = 1; i <= n; i++) g[i].clear();
  }
  return 0;
}
