3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MAXX = 1000000;
const int MAXN = 100000;
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];
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;
}
double bio_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 && !bio[v[curr][i].first])
      ret += bio_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));
  }
  bool ok = 1;
  int cx = -1, nx = 0;
  for (int i = (0), _for = (n); i < _for; ++i)
    if (v[i].size() == 1) nx = i;
  while (cx != nx) {
    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 = 0;
    for (int i = (0), _for = (v[cx].size()); i < _for; ++i) {
      double nju = bio_dfs(v[cx][i].first, 0, cx);
      if (nju > best) {
        best = nju;
        nx = v[cx][i].first;
      }
    }
  }
  printf("%d %.9lf", sol_pos, sol_val);
  return 0;
}
