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;
void Freopen() {
  freopen(
      "title"
      ".in",
      "r", stdin);
  freopen(
      "title"
      ".out",
      "w", stdout);
}
int read() {
  int g = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || '9' < ch) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while ('0' <= ch && ch <= '9') {
    g = g * 10 + ch - '0';
    ch = getchar();
  }
  return g * f;
}
const int N = 2e5 + 5;
const int INF = 1e9;
struct Edge {
  int to, ne, w;
} e[N << 1];
int h[N], cnt, size[N], vis[N], a[N], rt, ans1, n;
double d[N], su, sd, ans2;
void add(int x, int y, int w) {
  e[++cnt] = Edge{y, h[x], w};
  h[x] = cnt;
}
void dfs(int x, int fa, int s) {
  size[x] = 1;
  int maxn = 0;
  for (int i = h[x]; i; i = e[i].ne) {
    int y = e[i].to;
    if (vis[y] || y == fa) continue;
    dfs(y, x, s), size[x] += size[y];
    maxn = max(maxn, size[y]);
  }
  maxn = max(maxn, s - size[x]);
  if (maxn <= (s >> 1)) rt = x;
}
void calc(int x, int fa, int anc, int w) {
  su += pow(w, 1.5) * a[x], d[anc] += pow(w, 0.5) * 1.5 * a[x];
  for (int i = h[x]; i; i = e[i].ne) {
    int y = e[i].to;
    if (y == fa) continue;
    calc(y, x, anc, w + e[i].w);
  }
}
void solve(int x, int s) {
  dfs(x, 0, s), x = rt, dfs(x, 0, s);
  if (vis[x]) return;
  vis[x] = 1, su = sd = 0;
  for (int i = h[x]; i; i = e[i].ne) {
    int y = e[i].to;
    d[y] = 0;
    calc(y, x, y, e[i].w);
    sd += d[y];
  }
  if (su < ans2) ans1 = x, ans2 = su;
  for (int i = h[x]; i; i = e[i].ne) {
    int y = e[i].to;
    if (sd - d[y] * 2 >= 0) continue;
    solve(y, size[y]);
    break;
  }
}
signed 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(), w = read();
    add(x, y, w), add(y, x, w);
  }
  ans2 = 1e20;
  solve(1, n);
  return cout << ans1 << ' ' << fixed << setprecision(20) << ans2, signed();
}
