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;
int n;
int A[200306];
int head[200306], to[200306 << 1], nex[200306 << 1], wto[200306 << 1], ecn;
void ade(int u, int v, int w) {
  wto[++ecn] = w, to[ecn] = v, nex[ecn] = head[u], head[u] = ecn;
}
int vis[200306], siz[200306], sz;
int p, mx;
void dfs(int u, int fa) {
  siz[u] = 1;
  int s = 0;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == fa || vis[v]) continue;
    dfs(v, u);
    siz[u] += siz[v];
    s = max(s, siz[v]);
  }
  s = max(s, sz - siz[u]);
  if (s < mx) p = u, mx = s;
}
int dep[200306];
double all, pia;
int via = 0, pre;
double getit(int u, int fa) {
  if (u == pre) via = 1;
  double ret = A[u] * 1.5 * sqrt(1.0 * dep[u]);
  all += A[u] * sqrt(1.0 * dep[u]) * dep[u];
  pia += ret;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (v == fa) continue;
    dep[v] = dep[u] + wto[i];
    ret += getit(v, u);
  }
  return ret;
}
double re[200306];
double ans = 8e18;
int ps;
void solve(int u) {
  vis[u] = 1;
  all = pia = 0.0;
  int tr = u;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    dep[v] = wto[i];
    re[v] = getit(v, u);
    if (via) tr = v;
  }
  if (all < ans) ans = all, ps = u;
  for (int i = head[u]; i; i = nex[i]) {
    int v = to[i];
    if (vis[v]) continue;
    if (pia - 2 * re[v] <= 1e-7) {
      p = 0, mx = 0x3f3f3f3f;
      sz = siz[u];
      dfs(v, u);
      pre = u;
      solve(p);
      dep[tr] = 0.0;
      all = 0;
      getit(tr, tr);
      if (all < ans) ans = all, ps = tr;
    }
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) scanf("%d", &A[i]);
  for (int i = 1, u, v, w; i < n; ++i) {
    scanf("%d%d%d", &u, &v, &w), ade(u, v, w), ade(v, u, w);
  }
  mx = 0x3f3f3f3f;
  sz = n;
  dfs(1, 1);
  solve(p);
  printf("%d %.7lf", ps, ans);
}
