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;
int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
int n, a[200005], v[200005], w[200005], head[200005], nxt[200005], cnt, ans,
    siz[200005], vis[200005], rt;
double d[200005], ans1 = 1e18, now;
void add(int a, int b, int c) {
  v[++cnt] = b;
  w[cnt] = c;
  nxt[cnt] = head[a];
  head[a] = cnt;
}
void find(int x, int fa, int Siz) {
  siz[x] = 1;
  int maxn = 0;
  for (int i = head[x]; i; i = nxt[i]) {
    if (v[i] == fa || vis[v[i]]) continue;
    find(v[i], x, Siz);
    siz[x] += siz[v[i]];
    maxn = max(maxn, siz[v[i]]);
  }
  maxn = max(maxn, Siz - siz[x]);
  if (maxn <= Siz / 2) rt = x;
}
void calc(int x, int fa, int fath, int dis) {
  now += pow(dis, 1.5) * a[x];
  d[fath] += pow(dis, 0.5) * a[x] * 1.5;
  for (int i = head[x]; i; i = nxt[i]) {
    if (v[i] != fa) calc(v[i], x, fath, dis + w[i]);
  }
}
void dfs(int x, int Siz) {
  if (vis[x]) return;
  vis[x] = 1;
  find(x, 0, Siz);
  x = rt;
  find(x, 0, Siz);
  double sum = 0.0;
  now = 0.0;
  for (int i = head[x]; i; i = nxt[i]) {
    d[v[i]] = 0.0;
    calc(v[i], x, v[i], w[i]);
    sum += d[v[i]];
  }
  if (now < ans1) ans = x, ans1 = now;
  for (int i = head[x]; i; i = nxt[i]) {
    if (sum - 2 * d[v[i]] < 0) dfs(v[i], siz[v[i]]);
  }
}
int main() {
  n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  for (int i = 1; i < n; i++) {
    int x = read(), y = read(), z = read();
    add(x, y, z);
    add(y, x, z);
  }
  dfs(1, n);
  printf("%d %.20lf\n", ans, ans1);
}
