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;
struct edge {
  int to, nxxt, len;
} e[200014 << 1];
int n, a[200014], head[200014], cnt = 1, siz[200014], msz[200014], sum, rt, ans;
bool vis[200014];
double val = 1e180, dep[200014], f[200014], tsu;
inline void ins(int u, int v, int w) {
  e[cnt] = (edge){v, head[u], w};
  head[u] = cnt++;
}
void getrt(int te, int la) {
  siz[te] = 1;
  msz[te] = 0;
  for (int i = head[te]; i; i = e[i].nxxt) {
    int j = e[i].to;
    if (j == la || vis[j]) continue;
    getrt(j, te);
    siz[te] += siz[j], msz[te] = max(msz[te], siz[j]);
  }
  msz[te] = max(msz[te], sum - siz[te]);
  if (msz[te] < msz[rt]) rt = te;
}
void dfs(int te, int la) {
  tsu += 1.0 * a[te] * pow(dep[te], 1.5);
  f[te] = 1.0 * a[te] * sqrt(dep[te]);
  for (int i = head[te]; i; i = e[i].nxxt) {
    int j = e[i].to;
    if (j == la) continue;
    dep[j] = dep[te] + e[i].len;
    dfs(j, te);
    f[te] += f[j];
  }
}
void getsiz(int te, int la) {
  siz[te] = 1;
  for (int i = head[te]; i; i = e[i].nxxt) {
    int j = e[i].to;
    if (j == la || vis[j]) continue;
    getsiz(j, te);
    siz[te] += siz[j];
  }
}
void solve(int te) {
  dep[te] = 0;
  tsu = 0;
  dfs(te, te);
  vis[te] = 1;
  if (tsu < val) val = tsu, ans = te;
  for (int i = head[te]; i; i = e[i].nxxt) {
    int j = e[i].to;
    if (vis[j]) continue;
    double tva = 1.5 * (f[te] - 2 * f[j]);
    if (tva < 0) {
      getsiz(j, te);
      sum = siz[j], rt = 0;
      msz[rt] = siz[j];
      getrt(j, te);
      solve(rt);
      return;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++) {
    int x, y, z;
    scanf("%d%d%d", &x, &y, &z);
    ins(x, y, z), ins(y, x, z);
  }
  sum = msz[rt] = n;
  getrt(1, 1);
  solve(rt);
  printf("%d %.9lf\n", ans, val);
}
