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;
const int N = 2e5 + 50;
const long double INF = 1e23;
int n, a[N];
int fi[N], nxt[N << 1], to[N << 1], w[N << 1], tot;
void add(int x, int y, int z) {
  nxt[++tot] = fi[x], fi[x] = tot, to[tot] = y, w[tot] = z;
}
bool ban[N];
int sz[N], rt, Siz;
void pre_dfs(int u, int f) {
  sz[u] = 1;
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (ban[v] || v == f) continue;
    pre_dfs(v, u);
    sz[u] += sz[v];
  }
}
void getrt(int u, int f) {
  int mx = sz[0] - sz[u];
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (ban[v] || v == f) continue;
    getrt(v, u);
    mx = max(mx, sz[v]);
  }
  if (mx < Siz) Siz = mx, rt = u;
}
long double S[N], ans = INF, now;
int nd;
void calc(int u, int f, long double d) {
  now += d * sqrt(d) * a[u];
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == f) continue;
    calc(v, u, d + w[i]);
  }
}
void dfs(int r, int u, int f, long double d) {
  S[r] += 1.5 * a[u] * sqrt(d);
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (v == f) continue;
    dfs(r, v, u, d + w[i]);
  }
}
void work(int u) {
  rt = 0;
  pre_dfs(u, 0);
  Siz = sz[0] = sz[u];
  getrt(u, 0);
  u = rt;
  long double Sm = 0;
  ban[u] = true;
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (ban[v]) continue;
    S[v] = 0, dfs(v, v, u, w[i]);
    Sm += S[v];
  }
  now = 0;
  calc(u, 0, 0);
  if (now < ans) ans = now, nd = u;
  for (int i = fi[u]; i; i = nxt[i]) {
    int v = to[i];
    if (ban[v]) continue;
    if (Sm - S[v] * 2 < 0) work(v);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1, x, y, z; i < n; i++)
    scanf("%d%d%d", &x, &y, &z), add(x, y, z), add(y, x, z);
  work(1);
  printf("%d %.8Lf", nd, ans);
  return 0;
}
