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 long long maxn = 4e5 + 10;
const long long INF = 9e18;
long long n, a[maxn], Begin[maxn], Next[maxn], To[maxn], e, W[maxn], Root, Max,
    size[maxn], S, pos;
bool vis[maxn];
double ans = INF, f[maxn];
inline void add(long long u, long long v, long long w) {
  To[++e] = v;
  Next[e] = Begin[u];
  Begin[u] = e;
  W[e] = w;
}
inline void Get(long long u, long long fa) {
  size[u] = 1;
  long long x = 0;
  for (long long i = Begin[u]; i; i = Next[i]) {
    long long v = To[i];
    if (v == fa || vis[v]) continue;
    Get(v, u);
    size[u] += size[v];
    x = max(x, size[v]);
  }
  x = max(x, S - size[u]);
  if (x < Max) {
    Max = x;
    Root = u;
  }
}
inline double calc(double x) { return sqrt(x * x * x); }
inline double DFS1(long long u, long long fa, long long dep) {
  double ret = calc(dep) * a[u];
  for (long long i = Begin[u]; i; i = Next[i]) {
    long long v = To[i];
    if (v == fa) continue;
    ret += DFS1(v, u, dep + W[i]);
  }
  return ret;
}
inline double DFS2(long long u, long long fa, long long dep) {
  double ret = sqrt((double)dep) * a[u] * 1.5;
  for (long long i = Begin[u]; i; i = Next[i]) {
    long long v = To[i];
    if (v == fa) continue;
    ret += DFS2(v, u, dep + W[i]);
  }
  return ret;
}
inline void Solve(long long u) {
  double t = DFS1(u, 0, 0);
  if (t < ans) {
    ans = t;
    pos = u;
  }
  double sum = 0;
  for (long long i = Begin[u]; i; i = Next[i]) {
    long long v = To[i];
    f[v] = DFS2(v, u, 0);
    sum += f[v];
  }
  vis[u] = true;
  for (long long i = Begin[u]; i; i = Next[i]) {
    long long v = To[i];
    if (vis[v] || sum - f[v] - f[v] > 0) continue;
    Max = S = size[v];
    Get(v, 0);
    Solve(Root);
    return;
  }
}
signed main() {
  scanf("%lld", &n);
  for (long long i = (1), _end_ = (n); i <= _end_; ++i) scanf("%lld", &a[i]);
  for (long long i = (1), _end_ = (n - 1); i <= _end_; ++i) {
    long long u, v, w;
    scanf("%lld%lld%lld", &u, &v, &w);
    add(u, v, w);
    add(v, u, w);
  }
  Max = S = n;
  Get(1, 0);
  Solve(Root);
  printf("%lld %.6lf\n", pos, ans);
  return 0;
}
