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 int read() {
  int res = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -f;
    ch = getchar();
  }
  while (isdigit(ch)) {
    res = res * 10 + ch - '0';
    ch = getchar();
  }
  return res * f;
}
namespace qiqi {
const int N = 2e5 + 5;
int n, w[N], ecnt, head[N], pos, siz[N], rt, rts, sum;
double now, d[N], ans = 1e100;
bool vis[N];
struct Edge {
  int v, w, nxt;
} e[N << 1];
inline void add(int u, int v, int w) {
  e[++ecnt] = (Edge){v, w, head[u]};
  head[u] = ecnt;
}
void getrt(int u, int fa) {
  int mx = 0;
  siz[u] = 1;
  for (int i = head[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
    if (v != fa && !vis[v]) {
      getrt(v, u);
      siz[u] += siz[v];
      mx = max(mx, siz[v]);
    }
  mx = max(mx, sum - siz[u]);
  if (mx < rts) {
    rt = u;
    rts = mx;
  }
}
double dfs(int u, int fa, int d) {
  double res = sqrt(d) * w[u];
  now += sqrt(d) * d * w[u];
  for (int i = head[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
    if (v != fa) res += dfs(v, u, d + e[i].w);
  return res;
}
void solve(int u) {
  vis[u] = 1;
  double sd = now = 0;
  for (int i = head[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
    sd += d[v] = dfs(v, u, e[i].w);
  if (now < ans) {
    pos = u;
    ans = now;
  }
  for (int i = head[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
    if (!vis[v] && sd - d[v] * 2 < 0) {
      rts = sum = siz[v] < siz[u] ? siz[v] : sum - siz[u];
      getrt(v, u);
      solve(rt);
    }
}
void main() {
  n = read();
  for (int i = (1); i <= (n); ++i) w[i] = read();
  for (int i = (2); i <= (n); ++i) {
    int x = read(), y = read(), z = read();
    add(x, y, z);
    add(y, x, z);
  }
  rts = sum = n;
  getrt(1, 0);
  solve(rt);
  printf("%d %.10lf\n", pos, ans);
}
}  // namespace qiqi
int main() {
  qiqi::main();
  return 0;
}
