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 long long N = 400005;
long long ec = 0, to[N << 1], nxt[N << 1], ew[N << 1], hed[N];
void add_edge(long long f, long long t, long long cst) {
  ++ec;
  to[ec] = t;
  nxt[ec] = hed[f];
  hed[f] = ec;
  ew[ec] = cst;
}
long long n;
long long rt, tot, siz[N], dfz[N], mxd[N], w[N];
void find_rt(long long u, long long f) {
  siz[u] = 1;
  mxd[u] = 0;
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (dfz[v] || v == f) continue;
    find_rt(v, u);
    siz[u] += siz[v];
    mxd[u] = max(mxd[u], siz[v]);
  }
  mxd[u] = max(tot - mxd[u], mxd[u]);
  if (mxd[u] < mxd[rt]) rt = u;
}
double sw[N], d[N];
long long dis[N];
void dfs_calc(long long u, long long f) {
  sw[u] = pow(dis[u], 1.5) * w[u];
  d[u] = pow(dis[u], 0.5) * 1.5 * w[u];
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (v == f) continue;
    dis[v] = dis[u] + ew[i];
    dfs_calc(v, u);
    sw[u] += sw[v];
    d[u] += d[v];
  }
}
double ans = 1e177;
long long id = -1;
void solve(long long u) {
  double sd = 0.0, sum = 0.0;
  find_rt(u, 0);
  dfz[u] = 1;
  for (long long i = 1; i <= n; i++) d[i] = 0.0;
  sd = 0.0;
  dis[u] = 0;
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    dis[v] = ew[i];
    dfs_calc(v, u);
    sd += d[v];
    sum += sw[v];
  }
  if (sum < ans) {
    id = u;
    ans = sum;
  }
  for (long long i = hed[u]; i; i = nxt[i]) {
    long long v = to[i];
    if (dfz[v]) continue;
    if (sd - 2.0 * d[v] < 0) {
      rt = 0;
      tot = siz[v];
      find_rt(v, u);
      solve(rt);
      break;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  long long tu, tv, tw;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> w[i];
  for (long long i = 1; i < n; i++) {
    cin >> tu >> tv >> tw;
    add_edge(tu, tv, tw);
    add_edge(tv, tu, tw);
  }
  rt = 0;
  mxd[0] = n + 1;
  tot = n;
  find_rt(1, 0);
  solve(rt);
  printf("%lld %.10lf\n", id, ans);
  return 0;
}
