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 maxn = 200200;
long double ans;
int pos, n;
struct T {
  int to, nxt, v;
} way[maxn << 1];
;
int h[maxn], num;
int vis[maxn], w[maxn];
inline void link(int x, int y, int v) {
  way[++num] = {y, h[x], v}, h[x] = num;
  way[++num] = {x, h[y], v}, h[y] = num;
}
long double calc(int x, int f = 0, long double s = 0) {
  long double ret = s * sqrtl(s) * w[x];
  for (int i = h[x]; i; i = way[i].nxt)
    if (way[i].to != f) ret += calc(way[i].to, x, s + way[i].v);
  return ret;
}
long double calc2(int x, int f = 0, long double s = 0) {
  long double ret = 1.5 * sqrtl(s) * w[x];
  for (int i = h[x]; i; i = way[i].nxt)
    if (way[i].to != f) ret += calc2(way[i].to, x, s + way[i].v);
  return ret;
}
int size[maxn];
inline void getsz(int x, int f = 0) {
  size[x] = 1;
  for (int i = h[x]; i; i = way[i].nxt)
    if (!vis[way[i].to] && way[i].to != f)
      getsz(way[i].to, x), size[x] += size[way[i].to];
}
int mn, rt;
inline void getrt(int x, int sz, int f = 0) {
  int mx = sz - size[x];
  for (int i = h[x]; i; i = way[i].nxt)
    if (!vis[way[i].to] && way[i].to != f)
      getrt(way[i].to, sz, x), mx = std::max(mx, size[way[i].to]);
  if (mx < mn) mn = mx, rt = x;
}
inline int getroot(int x) {
  mn = 1e9, getsz(x), getrt(x, size[x]);
  return rt;
}
inline void dfs(int x) {
  std::vector<std::pair<long double, int> > v;
  x = getroot(x);
  vis[x] = 1;
  for (int i = h[x]; i; i = way[i].nxt)
    if (!vis[way[i].to])
      v.emplace_back(calc2(way[i].to, x, way[i].v), way[i].to);
  std::sort(v.rbegin(), v.rend());
  long double p = calc(x);
  if (p < ans) ans = p, pos = x;
  if (v.size()) dfs(v.begin()->second);
}
int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  std::cin >> n;
  for (int i = 1; i <= n; ++i) std::cin >> w[i];
  for (int i = 1, x, y, v; i < n; ++i) std::cin >> x >> y >> v, link(x, y, v);
  ans = 1e50;
  dfs(1);
  std::cout << pos << ' ' << std::setprecision(20) << ans << '\n';
}
