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;
template <typename T>
inline T read(register T& t) {
  register T f = 1;
  register char ch = getchar();
  t = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') t = t * 10 + ch - '0', ch = getchar();
  t *= f;
  return t;
}
template <typename T, typename... Args>
inline void read(T& t, Args&... args) {
  read(t);
  read(args...);
}
const long long p = 998244353;
inline long long power(register long long x, register long long k = p - 2) {
  register long long re = 1;
  for (; k; k >>= 1, x = x * x % p)
    if (k & 1) re = re * x % p;
  return re;
}
int n;
int head[200005], to[400005], ne[400005], val[400005], total = 1;
inline void add(int a, int b, int c) {
  total++;
  to[total] = b;
  ne[total] = head[a];
  head[a] = total;
  val[total] = c;
}
int a[200005];
bool vis[200005];
int pre;
int size[200005];
int rt, mi;
void find_root(int now, int fa) {
  size[now] = 1;
  int mx = 0;
  for (int i = head[now]; i; i = ne[i])
    if (to[i] != fa && vis[to[i]] == 0) {
      find_root(to[i], now);
      size[now] += size[to[i]];
      mx = max(mx, size[to[i]]);
    }
  mx = max(mx, pre - size[now]);
  if (mx < mi) mi = mx, rt = now;
}
long double d[200005];
long double calc(int now, int len, int fa) {
  d[now] = 1.5 * a[now] * pow(len, 0.5);
  long double sum = pow(len, 1.5) * a[now];
  for (int i = head[now]; i; i = ne[i])
    if (to[i] != fa) sum += calc(to[i], len + val[i], now);
  return sum;
}
int opt;
long double ans = 1e18;
void devide(int now, int S) {
  pre = S;
  mi = 1e9;
  find_root(now, now);
  long double qwq = calc(rt, 0, rt);
  if (qwq < ans) ans = qwq, opt = rt;
  vis[rt] = 1;
  long double sum = 0;
  for (int i = head[rt]; i; i = ne[i]) sum += d[to[i]];
  for (int i = head[rt]; i; i = ne[i])
    if (vis[to[i]] == 0 && sum - d[to[i]] < d[to[i]])
      return devide(to[i], size[to[i]]);
}
int main() {
  read(n);
  for (int i = 1; i <= n; i++) read(a[i]);
  for (int i = 1, x, y, z; i < n; i++)
    read(x, y, z), add(x, y, z), add(y, x, z);
  devide(1, n);
  printf("%d %Lf\n", opt, ans);
  return 0;
}
