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;
inline long long read() {
  long long num = 0, neg = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') neg = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    num = (num << 3) + (num << 1) + c - '0';
    c = getchar();
  }
  return num * neg;
}
int to[400010], head[200010], nxt[400010], val[400010], cnt;
int siz[200010], mxsiz[200010], rt, p[200010], vis[200010];
double sum, f[200010], sum1, ans;
int res, n, totsiz;
inline void insert(int x, int y, int z) {
  to[++cnt] = y, nxt[cnt] = head[x], head[x] = cnt, val[cnt] = z;
}
inline void getrt(int u, int fa) {
  siz[u] = 1, mxsiz[u] = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa || vis[v]) continue;
    getrt(v, u);
    siz[u] += siz[v];
  }
  mxsiz[u] = max(siz[u], totsiz - siz[u]);
  if (mxsiz[u] < mxsiz[rt]) rt = u;
  return;
}
inline void calc(int u, int fa, int top, int dep) {
  sum += 1.0 * p[u] * pow(dep, 1.5);
  f[top] += (double)sqrt(dep) * p[u] * 1.5;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == fa) continue;
    calc(v, u, top, dep + val[i]);
  }
  return;
}
inline void solve(int u) {
  if (vis[u]) return;
  vis[u] = 1, sum = 0, sum1 = 0;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    f[v] = 0;
    calc(v, u, v, val[i]);
    sum1 += f[v];
  }
  if (sum <= ans) ans = sum, res = u;
  for (int i = head[u]; i; i = nxt[i]) {
    int v = to[i];
    if (sum1 - 2 * f[v] < 0) {
      mxsiz[0] = n, rt = 0;
      totsiz = siz[v];
      getrt(v, u);
      solve(rt);
      break;
    }
  }
}
int main() {
  n = read();
  totsiz = n;
  for (int i = 1, x; i <= n; i++) p[i] = read();
  for (int i = 1, x, y, z; i < n; i++) {
    x = read(), y = read(), z = read();
    insert(x, y, z), insert(y, x, z);
  }
  mxsiz[0] = 100, rt = 0;
  getrt(1, 0);
  solve(rt);
  printf("%d %.10lf\n", res, ans);
  return 0;
}
