#include <bits/stdc++.h>
using namespace std;
const int limite = 1000000;
int n;
vector<pair<int, int> > g[limite];
int w[limite];
double calcula(int u, int p, int len) {
  double sol = pow(double(len), 1.5) * w[u];
  vector<pair<int, int> > &ar = g[u];
  for (int i = 0; i < int(ar.size()); i++) {
    int v = ar[i].first;
    int l = ar[i].second;
    if (v != p) sol += calcula(v, u, len + l);
  }
  return sol;
}
double derivada(int u, int p, int len) {
  vector<pair<int, int> > &ar = g[u];
  double sol = sqrt(double(len)) * w[u];
  for (int i = 0; i < int(ar.size()); i++) {
    int v = ar[i].first;
    int l = ar[i].second;
    if (v != p) sol += derivada(v, u, len + l);
  }
  return sol;
}
int numnodos[limite];
int padre[limite];
int superpadre[limite];
int identificador[limite];
vector<int> lista[limite];
void obtennumnodos(int u, int p) {
  padre[u] = p;
  numnodos[u] = 1;
  vector<pair<int, int> > &ar = g[u];
  for (int i = 0; i < int(ar.size()); i++) {
    int v = ar[i].first;
    if (v != p) {
      obtennumnodos(v, u);
      numnodos[u] += numnodos[v];
    }
  }
}
void genera(int u, int sp) {
  vector<int> &li = lista[u];
  for (;;) {
    li.push_back(u);
    vector<pair<int, int> > &ar = g[u];
    int nextu = 0;
    for (int i = 0; i < int(ar.size()); i++) {
      int v = ar[i].first;
      if (v != padre[u]) {
        if (2 * numnodos[v] >= numnodos[u]) {
          nextu = v;
        } else {
          genera(v, u);
        }
      }
    }
    if (nextu == 0) break;
    u = nextu;
  }
  u = li[0];
  for (int i = 0; i < int(li.size()); i++) {
    int v = li[i];
    superpadre[v] = sp;
    identificador[v] = u;
  }
}
int usol;
double dsol;
void busca(int u) {
  vector<int> &li = lista[u];
  int inf = 0;
  int sup = int(li.size()) - 1;
  while (inf + 2 < sup) {
    int med1 = (inf + inf + sup) / 3;
    int med2 = (inf + sup + sup) / 3;
    double c1 = calcula(li[med1], 0, 0);
    double c2 = calcula(li[med2], 0, 0);
    if (c1 > c2)
      inf = med1;
    else
      sup = med2;
  }
  int imin = inf;
  double cmin = calcula(li[inf], 0, 0);
  for (int i = inf + 1; i <= sup; i++) {
    double c = calcula(li[i], 0, 0);
    if (c < cmin) {
      imin = i;
      cmin = c;
    }
  }
  u = li[imin];
  if (cmin < dsol) {
    usol = u;
    dsol = cmin;
  }
  vector<pair<int, int> > &ar = g[u];
  vector<pair<int, double> > d;
  for (int i = 0; i < int(ar.size()); i++) {
    int v = ar[i].first;
    int l = ar[i].second;
    if (v != padre[u] and identificador[v] == v) {
      d.push_back(pair<int, double>(v, derivada(v, u, l)));
    }
  }
  if (int(d.size()) == 0) return;
  int imax = 0;
  for (int i = 1; i < int(d.size()); i++)
    if (d[i].second > d[imax].second) imax = i;
  busca(d[imax].first);
}
int main() {
  ios::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(8);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> w[i];
  for (int i = 0; i < n - 1; i++) {
    int u, v, l;
    cin >> u >> v >> l;
    g[u].push_back(pair<int, int>(v, l));
    g[v].push_back(pair<int, int>(u, l));
  }
  obtennumnodos(1, 0);
  genera(1, 0);
  usol = 1;
  dsol = calcula(1, 0, 0);
  busca(1);
  cout << usol << " " << dsol << endl;
}
