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 + 5;
const double inf = 1e18;
int n, root, id, siz[N], f[N];
double ans = inf, val[N], der[N], sum, sum_der;
bool vis[N];
struct node {
  int v, w;
};
vector<node> g[N];
void get_root(int u, int fa, int tot) {
  siz[u] = 1;
  for (unsigned i = 0; i < g[u].size(); i++) {
    int v = g[u][i].v;
    if (v != fa && !vis[v]) {
      get_root(v, u, tot);
      siz[u] += siz[v];
      f[u] = max(f[u], siz[v]);
    }
  }
  f[u] = max(f[u], tot - siz[u]);
  if (f[u] < f[root]) {
    root = u;
  }
}
void get_der(int u, int fa, int x, int dep) {
  sum += val[u] * dep * sqrt(dep);
  sum_der += val[u] * sqrt(dep) * 1.5;
  der[x] += val[u] * sqrt(dep) * 1.5;
  for (unsigned i = 0; i < g[u].size(); i++) {
    int v = g[u][i].v, w = g[u][i].w;
    if (v != fa) {
      get_der(v, u, x, dep + w);
    }
  }
}
void solve(int u) {
  sum = sum_der = 0, vis[u] = 1;
  memset(der, 0, sizeof(der));
  for (unsigned i = 0; i < g[u].size(); i++) {
    int v = g[u][i].v, w = g[u][i].w;
    get_der(v, u, v, w);
  }
  if (ans > sum) {
    id = u, ans = sum;
  }
  for (unsigned i = 0; i < g[u].size(); i++) {
    int v = g[u][i].v;
    if (sum_der - 2 * der[v] < 0 && !vis[v]) {
      root = 0;
      get_root(v, 0, siz[v]);
      solve(root);
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &val[i]);
  }
  for (int i = 1, u, v, w; i < n; i++) {
    scanf("%d%d%d", &u, &v, &w);
    g[u].push_back((node){v, w});
    g[v].push_back((node){u, w});
  }
  root = 0, f[0] = n;
  get_root(1, 0, n);
  solve(root);
  printf("%d %.10lf\n", id, ans);
  return 0;
}
