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 int maxn = 200010;
int n, cnt, mn, tot, rt, ans1;
double sum, sumd, ans2;
double w[maxn], val[maxn << 1], sd[maxn << 1];
int to[maxn << 1], head[maxn], nxt[maxn << 1], vis[maxn], siz[maxn];
inline int rd() {
  int ret = 0, f = 1;
  char gc = getchar();
  while (gc < '0' || gc > '9') {
    if (gc == '-') f = -f;
    gc = getchar();
  }
  while (gc >= '0' && gc <= '9') ret = ret * 10 + (gc ^ '0'), gc = getchar();
  return ret * f;
}
void getsz(int x, int fa) {
  siz[x] = 1;
  for (int i = head[x]; i != -1; i = nxt[i])
    if (to[i] != fa && !vis[to[i]]) getsz(to[i], x), siz[x] += siz[to[i]];
}
void getrt(int x, int fa) {
  int tmp = tot - siz[x];
  for (int i = head[x]; i != -1; i = nxt[i])
    if (to[i] != fa && !vis[to[i]]) getrt(to[i], x), tmp = max(tmp, siz[to[i]]);
  if (tmp < mn) mn = tmp, rt = x;
}
void calc(int x, int y, int fa, double dep) {
  sum += dep * sqrt(dep) * w[x], sumd += w[x] * sqrt(dep) * 3 / 2,
      sd[y] += w[x] * sqrt(dep) * 3 / 2;
  for (int i = head[x]; i != -1; i = nxt[i])
    if (to[i] != fa) calc(to[i], y, x, dep + val[i]);
}
void dfs(int x) {
  if (vis[x]) return;
  vis[x] = 1;
  int i;
  sum = sumd = 0;
  for (i = head[x]; i != -1; i = nxt[i])
    sd[to[i]] = 0, calc(to[i], to[i], x, val[i]);
  if (sum < ans2) ans2 = sum, ans1 = x;
  for (i = head[x]; i != -1; i = nxt[i])
    if (sumd - sd[to[i]] * 2 < 0) {
      getsz(to[i], x), tot = siz[to[i]], mn = 1 << 30, getrt(to[i], x), dfs(rt);
      break;
    }
}
inline void add(int a, int b, double c) {
  to[cnt] = b, val[cnt] = c, nxt[cnt] = head[a], head[a] = cnt++;
}
int main() {
  n = rd();
  int i, a, b, c;
  for (i = 1; i <= n; i++) w[i] = rd();
  memset(head, -1, sizeof(head));
  for (i = 1; i < n; i++) {
    a = rd(), b = rd(), c = rd();
    add(a, b, c), add(b, a, c);
  }
  ans2 = 1e20;
  getsz(1, 0), tot = n, mn = 1 << 30, getrt(1, 0), dfs(rt);
  printf("%d %.10lf", ans1, ans2);
  return 0;
}
