#include <bits/stdc++.h>
using namespace std;
const int MAXX = 1000000;
const int MAXN = 200000;
const int MOD = 1000000007;
const int INF = ((1 << 31) - 1);
bool bio[MAXN + 5];
int n, sol_pos;
int ima[MAXN + 5];
double cost[MAXN + 5];
double kor[MAXX + 5];
double sol_val = 1e50;
vector<pair<int, int> > v[MAXN + 5];
pair<pair<int, int>, int> in[MAXN + 5];
double val_dfs(int curr, int dist, int par) {
  double ret = kor[dist] * ima[curr];
  for (int i = (0), _for = (v[curr].size()); i < _for; ++i) {
    if (v[curr][i].first != par)
      ret += val_dfs(v[curr][i].first, dist + v[curr][i].second, curr);
  }
  return ret;
}
int cnt_dfs(int curr, int par) {
  int ret = 1;
  for (int i = (0), _for = (v[curr].size()); i < _for; ++i)
    if (v[curr][i].first != par && !bio[v[curr][i].first])
      ret += cnt_dfs(v[curr][i].first, curr);
  return ret;
}
pair<int, int> get_dfs(int curr, int par, int goal) {
  int sum = 1;
  for (int i = (0), _for = (v[curr].size()); i < _for; ++i) {
    if (v[curr][i].first == par || bio[v[curr][i].first]) continue;
    pair<int, int> a = get_dfs(v[curr][i].first, curr, goal);
    if (a.first > -1) return make_pair(a.first, 0);
    sum += a.second;
  }
  return sum * 2 >= goal ? make_pair(curr, 0) : make_pair(-1, sum);
}
int get_cent(int cx) {
  int cnt = cnt_dfs(cx, -1);
  int ret = get_dfs(cx, -1, cnt).first;
  return ret;
}
int main() {
  for (int i = (0), _for = (MAXX); i < _for; ++i)
    kor[i] = sqrt((double)i * i * i);
  for (int i = (0), _for = (MAXN); i < _for; ++i) cost[i] = 1e50;
  scanf("%d", &n);
  for (int i = (0), _for = (n); i < _for; ++i) scanf("%d", ima + i);
  for (int i = (0), _for = (n - 1); i < _for; ++i) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    a--, b--;
    v[a].push_back(make_pair(b, c));
    v[b].push_back(make_pair(a, c));
    in[i] = make_pair(make_pair(a + 1, b + 1), c);
  }
  bool ok = 1;
  int cx = -1, nx = 0;
  for (int i = (0), _for = (n); i < _for; ++i)
    if (v[i].size() == 1) nx = i;
  int cnt = 0;
  while (cx != nx) {
    cnt++;
    cx = get_cent(nx);
    if (cx >= 0 && bio[cx]) break;
    bio[cx] = 1;
    cost[cx] = val_dfs(cx, 0, -1);
    if (cost[cx] < sol_val) {
      sol_val = cost[cx];
      sol_pos = cx + 1;
    }
    double best = 1e50;
    double temp = 0;
    int mozda = 0;
    if (v[cx].size() < 3) {
      for (int i = (0), _for = (v[cx].size()); i < _for; ++i) {
        double nju = val_dfs(v[cx][i].first, 0, -1);
        if (nju < best) {
          best = nju;
          nx = v[cx][i].first;
        }
      }
    } else {
      for (int i = (0), _for = (v[cx].size()); i < _for; ++i) {
        double nju = val_dfs(v[cx][i].first, v[cx][i].second, cx);
        if (nju > temp) {
          temp = nju;
          nx = v[cx][i].first;
        }
      }
    }
  }
  printf("%d %.9lf", sol_pos, sol_val);
  return 0;
}
