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 N = 2e5 + 5;
int n, ww[N], x, y, z, i;
vector<pair<int, int> > e[N];
int ss[N], sz[N], rt, sum;
bool vi[N];
void getce(int x, int fa) {
  sz[x] = ss[x] = 1;
  for (pair<int, int> y : e[x])
    if (!vi[y.first] && y.first != fa)
      getce(y.first, x), sz[x] += sz[y.first], ss[x] = max(ss[x], sz[y.first]);
  ss[x] = max(ss[x], sum - sz[x]);
  if (ss[x] < ss[rt]) rt = x;
}
double dfs(int x, int fa, int d, int tp) {
  double ans = ww[x] * sqrt(d) * (tp ? d : 1);
  for (pair<int, int> y : e[x])
    if (y.first != fa) ans += dfs(y.first, x, d + y.second, tp);
  return ans;
}
int ans1;
double ans2;
void solve(int x) {
  vi[x] = 1;
  double mx = -1e30, z;
  int id = 0;
  for (pair<int, int> y : e[x])
    if (!vi[y.first]) {
      z = dfs(y.first, x, y.second, 0);
      sz[y.first] > sz[x] ? sz[y.first] = sum - sz[x] : 0;
      if (z > mx) mx = z, id = y.first;
    }
  z = dfs(x, 0, 0, 1);
  if (!ans1 || z < ans2) ans1 = x, ans2 = z;
  if (id) rt = 0, sum = sz[id], getce(id, x), solve(rt);
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%d", &ww[i]);
  for (i = 1; i < n; ++i)
    scanf("%d%d%d", &x, &y, &z), e[x].push_back(pair<int, int>(y, z)),
        e[y].push_back(pair<int, int>(x, z));
  ss[0] = 1 << 30;
  rt = 0;
  sum = n;
  getce(1, 0);
  solve(rt);
  printf("%d %.8f\n", ans1, ans2);
  return 0;
}
