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;
template <class T>
T gi() {
  T x = 0;
  bool f = 0;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f ? -x : x;
}
const int N = 2e5 + 10;
struct node {
  int to, nxt, w;
} g[N << 1];
int lst[N], gl, w[N];
void add(int z, int y, int x) {
  g[++gl] = (node){y, lst[x], z};
  lst[x] = gl;
  g[++gl] = (node){x, lst[y], z};
  lst[y] = gl;
}
int ans1;
double ans2;
int siz[N], mx, rt, sum;
bool vis[N];
void getroot(int u, int ff) {
  siz[u] = 1;
  int s = 0;
  for (int i = lst[u]; i; i = g[i].nxt) {
    int v = g[i].to;
    if (v == ff || vis[v]) continue;
    getroot(v, u);
    siz[u] += siz[v];
    s = max(s, siz[v]);
  }
  s = max(s, sum - siz[u]);
  if (s < mx) mx = s, rt = u;
}
double sd[N], sumd, ans;
void dfs(int u, int ff, int tp, double dep) {
  ans += sqrt(dep) * dep * w[u];
  sumd += 1.5 * sqrt(dep) * w[u];
  sd[tp] += 1.5 * sqrt(dep) * w[u];
  for (int i = lst[u]; i; i = g[i].nxt) {
    int v = g[i].to;
    if (v == ff) continue;
    dfs(v, u, tp, dep + g[i].w);
  }
}
void solve(int u) {
  vis[u] = 1;
  ans = sumd = 0;
  for (int i = lst[u]; i; i = g[i].nxt)
    sd[g[i].to] = 0, dfs(g[i].to, u, g[i].to, g[i].w);
  if (ans2 > ans) ans1 = u, ans2 = ans;
  for (int i = lst[u]; i; i = g[i].nxt) {
    int v = g[i].to;
    if (vis[v]) continue;
    if (sumd - sd[v] > sd[v]) continue;
    mx = sum = siz[v];
    getroot(v, u);
    solve(rt);
  }
}
int main() {
  int n = gi<int>();
  for (int i = 1; i <= n; i++) w[i] = gi<int>();
  for (int i = 1; i < n; i++) add(gi<int>(), gi<int>(), gi<int>());
  ans2 = 1e20;
  mx = sum = n;
  getroot(1, 0);
  solve(rt);
  printf("%d %.10lf\n", ans1, ans2);
  return 0;
}
