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>
const int N = 2e5 + 10;
std::vector<std::pair<int, int>> edges[N];
int size[N], mark[N], w[N], total;
double sum[N];
std::pair<int, int> centroid(int u, int p = -1) {
  int mx = 0;
  size[u] = 1;
  std::pair<int, int> ret{-1, -1};
  for (auto &e : edges[u]) {
    int v = e.first;
    if (v == p || mark[v]) continue;
    auto t = centroid(v, u);
    mx = std::max(mx, size[v]);
    size[u] += size[v];
    if (ret.first == -1 || t.first < ret.first) ret = t;
  }
  mx = std::max(mx, total - size[u]);
  if (ret.first == -1 || mx < ret.first) ret = {mx, u};
  return ret;
}
double dfs(int u, int p = -1, int d = 0) {
  sum[u] = w[u] * sqrt(d);
  double ret = sum[u] * d;
  for (auto &e : edges[u])
    if (e.first != p) {
      ret += dfs(e.first, u, d + e.second);
      sum[u] += sum[e.first];
    }
  return ret;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &w[i]);
  for (int i = 1; i < n; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    edges[u - 1].emplace_back(v - 1, w);
    edges[v - 1].emplace_back(u - 1, w);
  }
  int go = 0, ret = -1;
  double best = -1;
  for (total = n;;) {
    int u = centroid(go).second;
    double now = dfs(u);
    mark[u] = true;
    centroid(u);
    if (best == -1 || best > now) {
      best = now;
      ret = u;
    }
    bool found = false;
    for (auto &e : edges[u]) {
      int v = e.first;
      if (mark[v]) continue;
      if (sum[v] * 2 > sum[u]) {
        go = v;
        total = size[v];
        found = true;
        break;
      }
    }
    if (!found) break;
  }
  printf("%d %.10f\n", ret + 1, best);
  return 0;
}
