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() {
  char ch = getchar();
  long long s = 0, w = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    s = s * 10 + ch - '0';
    ch = getchar();
  }
  return s * w;
}
int size[200010];
int vis[200010], rt;
struct edge {
  int next, to;
  double v;
} e[200010 << 1];
int head[200010], n, ans1, cnt;
double sum = 0, sumd = 0;
double d[200010], w[200010], ans2 = 1e100;
inline void add_edge(int from, int to, double v) {
  e[++cnt] = (edge){head[from], to, v};
  head[from] = cnt;
}
void dfs(int now, int father, int Ns) {
  int maxn = 0;
  size[now] = 1;
  for (register int i = head[now]; i; i = e[i].next) {
    if (e[i].to == father || vis[e[i].to]) continue;
    dfs(e[i].to, now, Ns);
    maxn = max(maxn, size[e[i].to]);
    size[now] += size[e[i].to];
  }
  maxn = max(maxn, Ns - size[now]);
  if (maxn * 2 <= Ns) {
    rt = now;
  }
}
void calc(int now, int father, int o, double dis) {
  sum += pow(dis, 1.5) * w[now];
  d[o] += 1.5 * pow(dis, 0.5) * w[now];
  for (register int i = head[now]; i; i = e[i].next) {
    if (e[i].to == father) continue;
    calc(e[i].to, now, o, dis + e[i].v);
  }
}
void dfs(int now, int Siz) {
  dfs(now, 0, Siz);
  now = rt;
  dfs(now, 0, Siz);
  if (vis[now]) return;
  vis[now] = 1;
  sum = sumd = 0;
  for (register int i = head[now]; i; i = e[i].next) {
    int to = e[i].to;
    d[to] = 0;
    calc(to, now, to, e[i].v);
    sumd += d[to];
  }
  if (sum < ans2) ans2 = sum, ans1 = now;
  for (register int i = head[now]; i; i = e[i].next) {
    if (sumd - d[e[i].to] * 2 < 0) {
      dfs(e[i].to, size[e[i].to]);
      break;
    }
  }
}
int main() {
  n = read();
  for (register int i = 1; i <= n; i++) w[i] = read();
  for (register int i = 1; i < n; i++) {
    int x = read(), y = read();
    double v = read();
    add_edge(x, y, v);
    add_edge(y, x, v);
  }
  dfs(1, n);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
