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;
vector<pair<int, int> > v[200020];
int n;
int w[200020];
int erased[200020];
int down[200020];
void dfs(int x, int fa) {
  down[x] = 1;
  for (auto it : v[x]) {
    if (erased[it.second] == 0 && it.second != fa) {
      dfs(it.second, x);
      down[x] += down[it.second];
    }
  }
}
int fm(int x) {
  int half = (down[x] - 1) >> 1;
  while (1) {
    int nxt = -1;
    for (auto it : v[x]) {
      if (erased[it.second] == 0 && down[it.second] < down[x] &&
          down[it.second] > half) {
        nxt = it.second;
        break;
      }
    }
    if (nxt == -1) break;
    x = nxt;
  }
  return x;
}
double get1(int x, int fa, int len) {
  double res = w[x] * sqrt(len);
  for (auto it : v[x]) {
    if (it.second != fa && erased[it.second] == 0)
      res += get1(it.second, x, len + it.first);
  }
  return res;
}
double get2(int x, int fa, int len) {
  double res = w[x] * sqrt(len) * len;
  for (auto it : v[x]) {
    if (it.second != fa) res += get2(it.second, x, len + it.first);
  }
  return res;
}
int ans[2];
void solve(int x) {
  dfs(x, -1);
  x = fm(x);
  double mx = 0, sum = 0;
  int mxv = -1;
  for (auto it : v[x]) {
    if (erased[it.second] == 0) {
      double sub = get1(it.second, x, it.first);
      if (mx < sub) mx = sub, mxv = it.second;
      sum += sub;
    }
  }
  if (mxv == -1)
    ans[1] = x;
  else if (mx + mx < sum * (1 + 1e-12)) {
    ans[0] = x, ans[1] = mxv;
  } else {
    ans[0] = x;
    erased[x] = 1;
    return solve(mxv);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", w + i);
  if (n == 1) {
    printf("0 0");
    return 0;
  }
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    v[x].push_back(pair<int, int>(z, y));
    v[y].push_back(pair<int, int>(z, x));
  }
  solve(1);
  double res0 = get2(ans[0], -1, 0);
  double res1 = get2(ans[1], -1, 0);
  if (res0 < res1)
    printf("%d %.15f", ans[0], res0);
  else
    printf("%d %.15f", ans[1], res1);
  return 0;
}
